Adaptive communications methods for multiple user packet radio wireless networks

ABSTRACT

An exemplary wireless communication network that includes a base that communicates with remote units located in a cell of the network. A base concatenates information symbols with a preamble corresponding to a destination remote unit. One or more remote units communicating with a base each concatenates information symbols with a preamble corresponding to that remote unit. An adaptive receiver system for a base unit rapidly adapts optimal despreading weights for reproducing information symbols transmitted from multiple remote units. A transmitter system for a base unit concatenates information symbols with a preamble associated with a remote unit in the cell. An adaptive receiver system for a remote unit in a communication network rapidly adapts optimal weights for reproducing a signal transmitted to it by a specific base unit in the network. A transmitter system for a remote unit in a cell of a communication network which concatenates information symbols with preamble associated with the remote unit. A base initiates communication with a desired remote unit by transmitting an initiation codeword in a selected entry slot. One or more remote units each initiates communication with a bse by transmitting an initiation codeword associated with the remote unit in a selected entry slot. A remote unit synchronizes in time and frequency to the base using a sequence of synchronization signals transmitted by the base in a number of entry slots.

CROSS REFERENCE TO RELATED APPLICATION

This application claims the benefit of priority to U.S. ProvisionalApplication No. 60/273,829, filed Mar. 6, 2001.

BACKGROUND OF THE INVENTION

This invention relates to wireless communications, and more specificallyto adaptive methods for multiple user access in a dynamic wirelesscommunications network.

There is growing demand for high speed access to communication networksto support data, voice, and multimedia services. In addition to servicesbased on physical connectivity through wire or fiber, there isincreasing interest in the use of wireless communication networks.Wireless communication networks offer certain economies and flexibilitynot available in wired networks. These include reduced time and cost forinstallation and maintenance.

In wireless communication networks, multiple users share the samecommunication medium at the same time. Because the spectrum is limited,it is important to use it efficiently in order to accommodate the needsof all users desiring access within a reasonable time. The spectral andtemporal limitations lead to problems with radio interference amongusers transmitting at the same time.

The use of multiple antennas is known to enhance the performance and thecapacity of wireless communications networks. Most systems that exploitthe spatial properties of wireless communication links use multipleantennas with fixed beams that enhance a given spatial sector, therebyreducing interference from outside that sector. Additional performanceenhancements can be achieved using adaptive antenna arrays. For example,an adaptive array can place nulls in the direction of specificinterferers, such as from other users transmitting in the same frequencychannel, and can enhance the signal of interest. However, currenttechniques are generally unsuitable for use in data networks where dataare transmitted in discrete packets. Most of the techniques currentlysuggested adapt slowly and are unsuitable for point-to-multipointtopologies where users and their characteristics are constantlychanging.

In a packet-switched network, data transfer between nodes, for example,between a given user and a base station in a wireless network, istypically bursty, requiring high data rates for short periods of time.Preferably, a network should exploit the silent periods associated withone user to service other users in the network. Furthermore, spectrumlimitations, spectrum assignment to users in the network should bedynamic to accommodate changing bandwidth requirements and user loads.Existing methods for packet-radio systems typically suffer because of alack of flexibility in managing resources as users enter and leave thesystem and as the flow of data changes.

SUMMARY OF THE INVENTION

An exemplary wireless communication network in which the presentinvention may be implemented includes a base that communicates withremote units located in a cell of the network.

In one aspect of the present invention a base concatenates informationsymbols with a preamble corresponding to a destination remote unit. Theconcatenated signal is spread by base transmitter spreading weights andtransmitted. Each remote unit applies its preamble detector to thereceived data. Only the destination remote unit detects its preamble.The remote unit uses the detected preamble to generate optimaldespreading weights. The despreading weights are applied to theinformation portion of the received data to estimate the informationsymbols transmitted from the base.

In another aspect of the present invention, one or more remote unitscommunicating with a base each concatenates information symbols with apreamble corresponding to that remote unit. Each remote unit spreads theconcatenated signal with transmitter spreading weights and transmits thespread signal. The base detects each preamble corresponding to eachremote unit in the received data. Each detected preamble is used todetermine a set of optimal despreading weights corresponding to thatpreamble. Each set of despreading weights is applied to the informationportion of the received data to reproduce information symbolscorresponding to each remote unit.

Another aspect of the present invention is an adaptive receiver systemfor a base unit that rapidly adapts optimal despreading weights forreproducing information symbols transmitted from multiple remote units.The base receiver system uses matrix decomposition methods for detectingpreamble signals associated with remote units transmitting within a cellof the network. Each detected preamble is used to determine despreadingweights which when applied to the information portion of the receiveddata optimally estimates the information symbols transmitted from thecorresponding remote unit.

Another aspect of the present invention, is a transmitter system for abase unit, which concatenates information symbols with a preambleassociated with a remote unit in the cell. The concatenated signal isspread using spreading weights, which are formed by scaling andconjugating the base receiver despreading weights.

Another aspect of the present invention is an adaptive receiver systemfor a remote unit in a communication network which rapidly adaptsoptimal weights for reproducing a signal transmitted to it by a specificbase unit in the network. The remote unit receiver uses matrixdecomposition methods to detect its preamble signal in the receivedsignal data. The detected preamble is used to determine weights which,when applied to the received data, estimates the information symbolstransmitted to it from the base.

Another aspect of the present invention is a transmitter system for aremote unit in a cell of a communication network unit, whichconcatenates information symbols with preamble associated with theremote unit. The concatenated signal is spread using spreading weights,which are formed by scaling and conjugating the remote unit receiverdespreading weights.

In an exemplary time and frequency plan in which the present inventioncan be implemented, time is divided into time slots and a frequency bandis divided into a number of frequency partitions for each time slot.Each time slot includes a base transmit portion and a remote unittransmit portion. The base transmit and remote transmit portions of atime slot can be implemented using time division duplex (TDD)transmission. Each frequency partition includes a number of frequencybins. The frequency bins in the frequency partitions can be implementedusing discrete multitone (DMT) modulation. Particular partitions inparticular time slots are designated for messages related tocommunication initiation, synchronization, and other managementfunctions. These are referred to as entry slots.

In another aspect of the present invention a base initiatescommunication with a desired remote unit by transmitting an initiationcodeword in a selected entry slot. The initialization codeword isassociated with the desired remote unit. The desired remote unit remoteand other remote units each apply a detector during the selected entryslot. Only the detector of the desired remote unit detects theinitiation codeword in the selected entry slot. The desired remote unitthen transmits a response signal to the base.

In another aspect of the present invention one or more remote units eachinitiates communication with a base by transmitting an initiationcodeword associated with the remote unit in a selected entry slot. Thebase detects each codeword associated with each remote unit in eachselected entry slot. The base then transmits a response signal for eachremote unit.

In another aspect of the present invention a remote unit synchronizes intime and frequency to the base using a sequence of synchronizationsignals transmitted by the base in a number of entry slots. In a firststage of synchronization, the remote unit detects a portion of eachsynchronization signal to determine an initial frequency bin index of anentry slot. In a second stage, the remote unit detects the entiresynchronization signal for the sequence and uses the detectionstatistics to align its time slots and frequency partitions with thoseof the base.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other aspects of the invention will become more apparent andmore readily appreciated from the following detailed description of thepresently preferred exemplary embodiments of the invention taken inconjunction with the accompanying drawings, where:

FIG. 1 is a block diagram of a base station receiver including preambledetection and despreading operations, in accordance with an aspect ofthe present invention;

FIG. 2 illustrates beamforming which peaks in the direction of a signalof interest and a nulling in the direction of the interference, inaccordance with an aspect of the present invention;

FIG. 3 is a block diagram of base transmitter operations includingconcatenating a preamble to information data and forward link spreading,in accordance with an aspect of the present invention;

FIG. 4 illustrates an example of symbol mapping in time and frequency bybase forward link spreading, in accordance with an aspect of the presentinvention;

FIG. 5 is a block diagram of remote unit receiver operations includingpreamble detection and despreading operations, in accordance with anaspect of the present invention;

FIG. 6 is a block diagram of remote unit transmitter operationsincluding concatenating a preamble to information data and forward linkspreading, in accordance with an aspect of the present invention;

FIG. 7 illustrates an example of symbol mapping in time and frequency byremote unit forward link spreading, in accordance with an aspect of thepresent invention;

FIG. 8 is flow chart of a closed loop power control method, inaccordance with an aspect of the present invention;

FIG. 9 illustrates a time and frequency allocation for an embodiment ofan alert channel, in accordance with an aspect of the present invention;

FIG. 10 is a flow chart of an alert channel protocol method, inaccordance with an aspect of the present invention;

FIG. 11 illustrates time and frequency allocation for bearer channelcaches in partitions, in accordance with an aspect of the presentinvention;

FIG. 12 is a block diagram of a decision-direction method forcalculating weight updates, in accordance with an aspect of the presentinvention;

FIG. 13 is a diagram of an independent downlink/uplink (IDU) channellayout, in accordance with an aspect of the present invention;

FIG. 14 gives ping diagrams for initiating data transfer using the IDUmethod, in accordance with an aspect of the present invention;

FIG. 15 is a diagram of a coupled downlink/uplink (CDU) channel layout,in accordance with an aspect of the present invention;

FIG. 16 gives ping diagrams for initiating data transfer using the CDUmethod, in accordance with an aspect of the present invention;

FIG. 17 is a diagram of a hybrid downlink/uplink channel, in accordancewith an aspect of the present invention;

FIG. 18 illustrates an example of time and frequency use resulting froma remote unit bandwidth expansion method, in accordance with an aspectof the present invention;

FIG. 19 illustrates an exemplary wireless communications network inaccordance with a preferred embodiment;

FIG. 20. OSI Protocol Framework for reference in understanding an aspectof the present invention;

FIG. 21 illustrates tone partitions within a subband, in accordance withan aspect of the present invention;

FIG. 22 illustrates a frequency plan with a frequency spreading factorof two, in accordance with an aspect of the present invention;

FIG. 23 illustrates a frequency plan with a frequency spreading factorof four, in accordance with an aspect of the present invention;

FIG. 24 illustrates example of a time plan for a single time slot, inaccordance with an aspect of the present invention;

FIG. 25 gives a model useful for defining time delay parameters, inaccordance with an aspect of the present invention;

FIG. 26 illustrates a partition layout for a lower subband with aspectral spreading factor of 2 with a 4×6+1 layout, in accordance withan aspect of the present invention;

FIG. 27 illustrates a partition layout for a lower subband with aspectral spreading factor of 2 with an 8×3+1, in accordance with anaspect of the present invention;

FIG. 28. illustrates a partition layout for a lower subband with aspectral spreading factor of 4 with a 2×6 layout, in accordance with anaspect of the present invention;

FIG. 29 illustrates a partition layout for a spectral spreading factorof 4 with a 4×6 layout, in accordance with an aspect of the presentinvention;

FIG. 30 illustrates burst assignments in the forward link entry slot, inaccordance with an aspect of the present invention;

FIG. 31 illustrates a channel structure for an airlink frame, inaccordance with an aspect of the present invention;

FIG. 32. Frame Offset, in accordance with an aspect of the presentinvention;

FIG. 33 illustrates a reverse link initiated transfer, in accordancewith an aspect of the present invention;

FIG. 34 illustrates a forward link initiated transfer, in accordancewith an aspect of the present invention;

FIG. 35 is a state diagram of dynamic reverse link initialization (RLI)code assignment, in accordance with an aspect of the present invention;

FIG. 36 is a block diagram of a frequency locked loop forsynchronization of a remote unit with a base, in accordance with anaspect of the present invention;

FIG. 37 is a state diagram of synchronization acquisition by the remoteunit, in accordance with an aspect of the present invention;

FIG. 38 is a block diagram of the base receiver operations for reverselink initiation (RLI) and reverse link bearer (RLB) data processingincluding RLI detection, despreading weight computation anddecision-directed updating of despreading weights, in accordance with anaspect of the present invention;

FIG. 39 is a block diagram of a rate ⅔, 2m-state convolutional encoderwith feedback, in accordance with an aspect of the present invention;

FIG. 40 illustrates a scalable trellis-coded mapper, in accordance withan aspect of the present invention;

FIG. 41 illustrates symbol mapping by a rate ⅘ trellis-coded modulationencoder, in accordance with an aspect of the present invention;

FIG. 42 is a block diagram of a Reed-Soloman encoder, in accordance withan aspect of the present invention;

FIG. 43 is a block diagram of a Reed-Soloman decoder, in accordance withan aspect of the present invention;

FIG. 44 is a block diagram of an automatic re-transmission request (ARQ)processor, in accordance with an aspect of the present invention;

FIG. 45 is a block diagram of physical layer transmission, in accordancewith an aspect of the present invention;

FIG. 46 illustrates a mapping of tones into IDFT bins by the IDFT binmapping of physical layer transmission, in accordance with an aspect ofthe present invention;

FIG. 47 is a functional block diagram for an example of insertion of acyclic prefix, in accordance with an aspect of the present invention;

FIG. 48 is an illustration of timing and weight dependencies during baseand remote unit communications, in accordance with an aspect of thepresent invention;

FIG. 49 is an illustration of base offset code assignments for a baseoffset code repeat factor of twelve and a hexagonal layout of cells, inaccordance with an aspect of the present invention;

FIG. 50 is an illustration showing azimuths of a subset of forward linkinitiation (FLI) codes and base code assignments with a repeat factor oftwelve and hexagonal layout of cells layout, in accordance with anaspect of the present invention;

FIG. 51 is an illustration of base offset code assignments for a baseoffset code repeat factor of twelve and a rectangular layout of cells,in accordance with an aspect of the present invention;

FIG. 52 is an illustration showing azimuths of a subset of forward linkinitiation (FLI) codes and base code assignments with a repeat factor oftwelve and rectangular layout of cells layout, in accordance with anaspect of the present invention;

FIG. 53 is an illustration of the relative timing of transmissions ofreverse link access (RLA), forward link access (FLA), and reverse linkinitiation (RLI) signals, in accordance with an aspect of the presentinvention;

FIG. 54 is a table listing parameters for applications of aspects of thepresent invention in particular bands of the spectrum;

FIG. 55 is a table of frequency plans for several bands of the spectrumwhere applications of aspects of the present invention may be deployed;

FIG. 56 is a table of example throughputs for a 4×6 layout and a 3⅓ mstime slot duration, in accordance with an aspect of the presentinvention;

FIG. 57 is a table of access codes used to derive reverse linkinitiation codewords from a Hadamard matrix, in accordance with anaspect of the present invention;

FIG. 58 is a listing of a sample computer program in Matlab® forgenerating forward link initiation (FLI) codewords, in accordance withan aspect of the present invention;

FIG. 59 is a listing of computer code in Matlab® that includes matricescontaining forward link synchronization (FLS) codeword descriptors, inaccordance with an aspect of the present invention;

FIG. 60 gives a computer program in Matlab® for synthesizing FLScodewords, in accordance with an aspect of the present invention;

FIG. 61 is a table of FLS codeword sequence numbers for a spreadingfactor of two, in accordance with an aspect of the present invention;

FIG. 62 is a table of FLS codeword number sequence for a spreadingfactor of four, in accordance with an aspect of the present invention;

FIG. 63 is a table of base transmit weight patterns for FLS bursts for aspreading factor of two, in accordance with an aspect of the presentinvention;

FIG. 64 is a table of assignments of reverse link initation (RLI)partitions based on forward link access (FLA) indices for a spreadingfactor of two, in accordance with an aspect of the present invention;

FIG. 65 is a table of assignments of reverse link initation (RLI)partitions based on forward link access (FLA) indices for a spreadingfactor of four, in accordance with an aspect of the present invention;

FIG. 66 is a diagram of a medium access control (MAC) frame structure,in accordance with an aspect of the present invention;

FIG. 67 is a diagram of a reverse link common MAC header of a MAC frame,in accordance with an aspect of the present invention;

FIG. 68 is a diagram of a forward link MAC common header of a MAC frame,in accordance with an aspect of the present invention;

FIG. 69 is a diagram of an extended MAC header of a MAC frame, inaccordance with an aspect of the present invention;

FIG. 70 is a diagram of a MAC message format, in accordance with anaspect of the present invention;

FIG. 71 is a diagram of a protocol data unit format, in accordance withan aspect of the present invention;

FIG. 72 is a diagram of a format for the logical link control (LLC)field of the protocol data unit of FIG. 71, in accordance with an aspectof the present invention;

FIG. 73 is a table of frame sizes and data rates for a 20 ms segments,in accordance with an aspect of the present invention;

FIG. 74 is a diagram of a frame of a 20 ms voice segment service dataunit (SDU) suitable for voice over Internet protocol (VoIP), inaccordance with an aspect of the present invention;

FIG. 75 is a diagram of a frame of a 10 ms voice segment service dataunit (SDU) suitable for VoIP, in accordance with an aspect of thepresent invention;

FIG. 76 is a table of frame sizes and data rates for a 10 ms segments,in accordance with an aspect of the present invention;

FIG. 77 is a table of VoIP payload sizes for various vocoders and VoIPframe duration, in accordance with an aspect of the present invention;

FIG. 78 is block diagram of data link layer (DLL) functions, inaccordance with an aspect of the present invention;

FIG. 79 is an illustration of the interaction of primitives used forvoice connection, in accordance with an aspect of the present invention;

FIG. 80 is a state diagram of logical link control (LLC) operations forvoice connections, in accordance with an aspect of the presentinvention;

FIG. 81 is an illustration of the interaction of primitives used fordata connections, in accordance with an aspect of the present invention;

FIG. 82 is a state diagram of LLC link setup, teardown and recoveryphase as defined in ISO/IEC 8802-2, a joint standard by theInternational Organization for Standardization and InternationalElectrotechnical Commission, for reference in understanding an aspect ofthe present invention;

FIG. 83 is a state diagram of the LLC information transfer phase asdefined in ISO/IEC 8802-2, for reference in understanding an aspect ofthe present invention;

FIG. 84 is the state transition diagram of MAC sublayer operations of aremote unit, in accordance with an aspect of the present invention;

FIG. 85 is an illustration of airlink frame structure, in accordancewith an aspect of the present invention;

FIG. 86 illustrates a protocol for connection initiation and datatransfer using the partitions of FIG. 85, in accordance with an aspectof the present invention;

FIG. 87 is a state diagram of a frame-driven component of a RU partitionengine, in accordance with an aspect of the present invention;

FIG. 88 is a flow diagram of a slot-driven component of a RU partionengine, in accordance with an aspect of the present invention;

FIG. 89 is a state diagram of a RU MAC scheduler, in accordance with anaspect of the present invention;

FIG. 90 lists events and actions of the RU MAC scheduler of FIG. 89, inaccordance with an aspect of the present invention;

FIG. 91 is a state diagram of a frame-driven component of a basepartition engine, in accordance with an aspect of the present invention;

FIG. 92 is a flow diagram of a slot-driven component of a base partitionengine, in accordance with an aspect of the present invention;

FIG. 93 is a flow diagram for a base partition engine for an accesschannel, in accordance with an aspect of the present invention;

FIG. 94 shows examples of partition allocation changes based on abacklog for each RU, in accordance with an aspect of the presentinvention;

FIG. 95 gives messages, states and actions of a base and RU for startinga flow, in accordance with an aspect of the present invention;

FIG. 96 gives messages, states and actions of a base and RU for variouserror conditions while starting a flow, in accordance with an aspect ofthe present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

An exemplary wireless communications network in accordance with apreferred embodiment is illustrated in the diagram of FIG. 19. In thisexample, a wireless communications network 212 is divided into threecells 214 a–214 c. A cell includes a central node referred to as a base216 a–216 c. Each cell 214 a–214 c represents an area of coverage by onecorresponding base 216 a–216 c, respectively. Typically the bases 216a–216 c are fixed and include connections to external networks such asthe Internet or networks supported and maintained by a service provider.

A remote unit, referred to as RU, is located in a cell. In the exampleof FIG. 19, RUs 218 a 1–218 a 9 provide broadband access to a singleuser or a network of users. Nine RUs 218 a 1–218 a 9 are shown in cell214 a for illustrative purposes. Additional RUs may be included in thefirst cell 214 a, as well as in the second and third cells 214 b–214 c.The RUs are fixed in this example, although in general they are notnecessarily fixed. Each RU communicates with the base for cell thatincludes the RU.

A base 216 a includes a transmitter and a receiver for communicationwith RUs 218 a 1–218 a 9 in the corresponding cell 214 a. Likewise, eachRU 218 a 1–218 a 9 also includes a transmitter and a receiver that isused for communication with base 216 a. Communication between the bases216 a–216 c and the RUs 218 a 1–218 a 9 using a relatively smallbandwidth wireless link. The bases typically communicate with each otherusing a backhaul network with a relatively high bandwidth resource suchas fiber optics, microwave or cable.

A base 216 a typically includes multiple sensors for communication withthe RUs 218 a 1–218 a 9. A RU typically includes just one sensor,although multiple sensors are possible. The term “sensor” is usedbroadly to designate any physical resource capable of receiving ortransmitting electromagnetic energy. As in typical communicationssystems, each sensor is connected to an associated system of electroniccomponents for downconverting and possibly digitizing the receivedwaveform or upconverting and transmitting an analog waveform derivedfrom a digital source. Two components function as separate sensors whensignal processing by each component is separate. For example, separateRF and digitizing components for multiple polarizations function asseparate sensors. A combination of multiple sensors is called an array,or a sensor array. For example, an array may be a combination of sensorelements separated by space or polarization.

In a typical arrangement, each base station uses multiple antennas andmultiple spreading frequencies, nominally two but up to four, totransmit data to remote units. Multiple antennas and spreadingfrequencies provide degrees of freedom exploited by the to form spatialand spectral gains and nulls for reliable communication with many remoteunits simultaneously. The base station can access all of the availablespectrum.

A remote unit uses a directional gain antenna and multiple spreadingfrequencies to transmit data to an assigned base station. Multiplespreading frequencies provide degrees of freedom used to form spectralgains and nulls. The RU uses the same spreading frequencies that thebase station uses in communication with the RU. A remote unit accesses aportion of the frequency spectrum, such as a single subband pair,available at the base station. Higher capacity remote units can beconfigured to make use of multiple subband pairs. In an alternateembodiment, a remote unit can have more than one antenna.

An orthogonal frequency division multiplexing (OFDM) structure is usedto minimize inter-symbol interference caused by multipath. For OFDM, adigital processing architecture includes fast transforms, andbeamforming and null steering algorithms. The system exploits multipleantenna elements at base stations and stacked carrier spread spectrum toprovide for increased system capacity.

Discrete Multitone (DMT) is a preferred modulation. It allows for theprocessing of multicarrier communication signals in the frequencydomain. A preferred embodiment uses Fast Fourier Transforms (FFT's) thatare either zero padded or have a cyclic prefix. Alternative embodiments,known in the art, include the use of a filter bank. DMT processingprovides frequency bins in a given frequency band. A set of adjacent,associated frequency bins referred to as a partition. Partitions areused for defining communication channels in the preferred embodiment.

Packet radio transmission is preferred for communications between bases216 a–216 c and RUs 218 a 1–218 a 9. For packet radio transmission,information is transmitted from a transmitter to a receiver in discretepackets.

Time Division Duplex (TDD) is a preferred protocol for transmission andreception between the base and the RUs. The TDD protocol is spectrumefficient because the same frequency resources are shared for bothtransmission and reception in a communications system. Transmissionevents are separated from reception events in time and typicallyalternate in a periodic fashion. To the extent possible, the same RFcomponents are used in both the transmission and reception paths at thebase and at the RU. This permits the effective channel seen from thebase to the RU to be reciprocal of the channel seen from the RU to thebase. This allows exploitation of channel reciprocity when formingtransmit signals. Physical layer communication is nearly symmetric sothat the spreading weights applied to the transmit signal are based onthe weights computed from the receive signal.

Methods and apparatus for transmitters and receivers that includemultiple sensors, DMT modulation, TDD protocol, and packet radiotransmission in a wireless communication network are described in Agee,U.S. Pat. No. 6,128,276.

The TDD slots and available blocks of frequency are partitioned toprovide multiple physical channels that support bearer traffic. A set ofcommunication channels used during a TDD frame when a base istransmitting and the RUs are receiving is called the forward link.Likewise, a set of communication channels used during a TDD frame when abase is receiving and the corresponding RUs are transmitting is calledthe reverse link.

The present invention provides a system of protocols for communicationbetween base 216 a and the RUs 218 a 1–218 a 9 in the corresponding cell214 a. Using the preferred system of protocols, the base 216 a providesmultiple links simultaneously to the nine RUs 218 a 1–218 a 9. Theselinks are established as needed for communicating RUs in the cell. For agiven interval, existing links may be deallocated and links to anentirely different set of RUs may be established.

The base acts as a central controller to efficiently manage airlinkresources. This is unlike Ethernet where access control is distributedamong all users and all users are connected to each other. In apreferred embodiment, the base schedules all traffic to RUs to meetservice level agreements. Distributing forward link traffic in thisscenario is relatively straightforward. For managing reverse linkbandwidth, traffic loading information is communicated from each RU toits corresponding base. Communications from a RU to a base arecontention oriented. With this approach, the base can schedule multipleusers to simultaneously “contend” for a communication channel. Tominimize contention by unscheduled users requesting access, a preferredentry method uses a home partition to initiate data flows.

When a RU is installed in the network, it is configured to communicatewith a single base. In one embodiment, a base offset code unique to theassigned base is provided. The RU uses the base offset code toselectively receive data from its corresponding base.

The physical channels for data traffic are divided into two generaltypes: bearer channels for high-speed transfer of bearer data, andinitiation channels for requesting access to the bearer channels.Reverse link initiation messages are contention oriented, whereas thebase station schedules the forward link initiation messages. For forwardlink initiation, the base uses entry slots for signaling a remote unitthat it has a message to download and for sending a weight-trainingmessage for maintaining an existing link.

The present invention includes the rapid computation of despreading andspreading weights for the receiver and transmitter, respectively, of thebase and RU. The despreading and spreading weights direct signal gaintoward intended recipients and signal nulls toward sources ofinterference. By exploiting reciprocity, the despreading weightsdetermined for reception are modified to provide spreading weights usedfor transmission. On the reverse link, the initiation messages alsoserve as training signals that base station uses to compute initialdespreading and spreading weights for bearer traffic. Once the initialweights are computed, decision-direction algorithms are used to adaptthe weights to time varying channel conditions.

The transmitter and receiver functions of the present invention can beimplemented using digital signal processors, such as general purposedigital signal processors (DSP) or, preferably, application specificintegrated circuits (ASIC). Functions are implemented on digital signalprocessors as programs and subroutines using well-known digital signalprocessing techniques. For a fully functional base and remote unit,additional secondary elements including antennae, RF amplifiers,downconverters, upconverters, local oscillators (LO), analog-to-digitalconverters (ADC, and digital-to-analog converters (DAC) would be addedto the base and remote unit transmitter and receiver functions describedherein. Such additions will be evident to those skilled in the art.

In the description that follows, reference is made to Open SystemsInterconnect (OSI) Reference Model established by the InternationalOrganization for Standardization (ISO). FIG. 20 illustrates the sevenlayer OSI reference model 300. The description that follows primarilyrefers to the physical layer 302, the data link layer 304 and data linksublayers for logical link control (LLC) 306 and medium access control(MAC) 308.

Base Receiver Operation

Referring to FIG. 19, the present invention includes methods for base216 a to communicate with nine RUs 218 a 1–218 a 9 in its correspondingcell 214 a. Base receiver operation includes preamble detection on acontention oriented channel that permits multiple RUs 218 a 1–218 a 9 toenter the system simultaneously.

FIG. 1 gives a block diagram of the base receiver 1. The base receiver 1computes a set of complex despreading weights for the purpose ofenhancing a signal of interest, and suppressing in-cell and out-of-cellinterferers. Relevant symbol definitions for FIG. 1 are

-   P: N_(p)×K_(p) Conjugate preamble vectors for each of up to K_(p)    users-   X_(p): N_(p)×K_(base) Conjugate received data at a base over the    time/frequency indices used by the known preamble-   X_(d): N_(d)×K_(base) Conjugate received data at a base over the    time/frequency indices used by the transmitted data symbols-   Q: N_(p)×K_(base) Whitened received data (orthonormal columns) after    the Q-R decomposition (QRD 8 of FIG. 1) of X_(p)-   R_(x): K_(base)×K_(base) Cholesky factor of X_(p)-   R_(qd): K_(base)×K_(p) Cross-correlation between whitened data and    known preambles-   b: N_(p)×1 Conjugate base scrambling code. (Used to decorrelate    R_(qd) with other bases)-   W_(r): K_(base)×K_(detect) Despreading gains for the K_(detect)    users detected

The dimensions K_(p) and K_(detect) respectively refer to a maximumnumber of users and the number of detected users in a given frequencypartition. The dimensions N_(p) and N_(d) respectively refer to thenumber of preamble symbols and the number of information symbols.

The number of sensors used by a base is K_(antenna). The number ofdegrees of freedom used by a base is K_(base), which includes all basesensors as well as the spreading frequencies. These two dimensions arerelated by K_(RU), the spreading factor used to expand the signalbandwidth whereby the total number of symbols transmitted will be aproduct of K_(RU) and the number of source symbols. That is, there areK_(base) separate digitized complex symbols that are received overK_(antenna) sensors and K_(RU) separate spreading frequencies so thatK_(base)=K_(antena)K_(RU).

Referring to FIG. 19, for example, a signal from RU 218 a 1 is receivedat base 216 a by base receiver 1 of FIG. 1. The processing operations ofFIG. 1 apply to a single frequency partition. For multiple partitions,analogous operations are applied in each partition. Referring to FIG. 1,data are received by preamble/data demultiplexer 2, or P/D DeMux. Basereceiver 1 may include first storage disk 4 for storing the conjugatebase scrambling code b and second storage disk 6 for storing conjugatepreamble vectors P. The conjugate received preamble X_(p) output fromP/D DeMux 2 is passed to QR decomposition, or QRD, block 8. QRD 8produces whitened received data matrix Q and the Cholesky factor matrixR_(x). Multiplier 10 combines the base scrambling code b and thewhitened received data Q and transfers the output to FFT bank 12.Conjugate preamble vectors P from storage element 6 are also input toFFT bank 12. FFT bank 12 produces the cross-correlation matrix R_(qd).Norm evaluator 14 calculates the norm of matrix R_(qd). The output ofnorm evaluator 14 is input to preamble detection block 16, whichidentifies detected preambles. Selection block 18 combines the outputfrom preamble detection block 16, the identified preamble, with R_(qd)output from FFT bank 12 to produce a reduced-order cross-correlation

_(qd) with dimensions K_(base) 33 K_(detect).

Weight-computation block 20 combines the reduced-order cross-correlation

_(qd) from selection block 18 with the Cholesky factor R_(x) from QRDblock 8 to produce the despreading gains matrix W_(r). Matrix productblock 22 combines the conjugate received data X_(d) with the despreadinggains W_(r). The output from matrix product block 22 is passed to delayequalization block 24. The results of the delay equalization block 22are then passed to a codec 26.

The preamble detection block 16 described herein provides forsimultaneous detection of preamble messages from multiple users. Inpractice, every active user 218 a 1–218 a 9 in a cell 214 a of thenetwork exemplified in FIG. 19 is assigned a preamble sequence and adesignated partition for requesting system access over a contentionoriented channel. For instance, a user 218 a 1 simply beginstransmission in his assigned partition using his assigned preamble.Because of the degrees of freedom available in the system by multiplesensors and multiple spreading frequencies, it is possible for the baseto resolve many users that simultaneously transmit on acontention-oriented channel. This provides an improvement overtraditional approaches where collisions occur when more than one usersimultaneously transmit a message and each user must retransmit theirmessage. A resulting advantage is that higher throughput can be achievedon the contention oriented channel, which reduces user access latency incases of high user loads.

The access method described herein is referred to as soft contentionbecause contention occurs only during periods of high system loading,and then users are not necessarily completely blocked, but rather theirperformance degrades gradually as the number of simultaneous entriesincreases.

Referring to FIG. 1, the base receiver can efficiently detect whichusers are transmitting in a given partition by performing FFT 12 duringthe computation of the cross-correlation coefficients R_(qd). Thedetection statistic used by the base receiver is,

$\rho_{d} = \frac{{\overset{\sim}{d}}^{H}{P\left( X_{p} \right)}\overset{\sim}{d}}{{\overset{\sim}{d}}^{H}\overset{\sim}{d}}$where the projection operator is defined as P(X)≡X(X^(H)X)⁻¹X^(H),{tilde over (d)} is a conjugate preamble vector chosen from a set ofknown preamble symbols, and X_(p) ^(H) is a matrix whose columns containall of the K_(base)×1 received data vectors over each frequency bin in agiven partition and the time indices within a single adaptationinterval. Therefore the matrix X_(p) ^(H) can be written asX _(p) ^(H) ≡[x(1,1), x(2,1), . . . , x(M,1), x(1,2), x(2,2), . . .x(M,N)],where x(m,n) is the K_(base)×1 complex baseband received data vector atfrequency index m and time index n.

The parameter M is the number of frequency bins reserved for thetransmitted preamble and N is the number of time samples reserved forthe transmitted preamble. The total number of preamble symbols istherefore N_(p)=MN. In a preferred embodiment, but without loss ofgenerality, the preamble symbols are in contiguous bins and in the firstN time samples of an adapt frame. The present invention is notrestricted to this configuration and encompasses any mapping of thepreamble symbols onto the available time and frequency indices. Ingeneral, it is most advantageous to evenly distribute the preamble overall of the bins in a partition.

The detection statistic can detect a large number of userssimultaneously transmitting in the same cell and the same frequencypartition. After a QR decomposition is performed on X_(p) so thatQR_(x)=X_(p), and Q is an orthonormal MN×K_(base) matrix and R_(x) is anK_(base)×K_(base) upper triangular matrix, the detection statistic canbe written as,

$\begin{matrix}{\rho_{d} = {\frac{{\overset{\sim}{d}}^{H}{QQ}^{H}\overset{\sim}{d}}{{\overset{\sim}{d}}^{H}\overset{\sim}{d}} = \frac{{{Q^{H}\overset{\sim}{d}}}^{2}}{{\overset{\sim}{d}}^{2}}}} & ({A1})\end{matrix}$Mis the number of bins in a partition, and N is the number of samples ina preamble block of an adapt frame.

In one embodiment, the preambles are chosen from a FFT basis of theform,

${d\left( {m,n} \right)} = {{\mathbb{e}}^{\frac{{- 2}\pi\mspace{11mu} j\;{k{({m + {M{({n - 1})}}})}}}{M_{c}}}{b\left( {m,n} \right)}}$where d(m,n) is a conjugate preamble symbol, b(m,n) is a conjugate basescrambling code symbol, M_(c) is the size of the FFT basis, m is thefrequency bin index, and n is the time index. The base scrambling codeis a constant modulus pseudo-random code. The index k selects thepreamble basis function. For purposes of searching for the correctlytransmitted preambles, the m+M(n−1)'th element of {tilde over (d)},{tilde over (d)}(m,n), can be set equal to d(m,n) above. By exploiting aFFT-like structure for the preambles, the computation of thecross-correlation Q^(H){tilde over (d)} can be performed veryefficiently.

In alternative embodiments, preambles are derived from other basisfunctions that yield fast transforms instead of FFT basis functions.These include Hadamard, Kronecker, wavelets, discrete cosine transform,etc., basis functions. An alternative embodiment using Hadamard basisfunctions is described later for reverse link initialization. Hadamardbasis functions have computational advantages over FFT. Also, morepreamble codes can be derived from the Hadamard basis functions so thatbase scrambling codes are not needed.

Even for a large number of preambles the computational complexity isdominated by the computation of Q. Most of the complexity of the systemis at the base rather than the RUs. This improves the economics of theoverall system design.

The base scrambling code, b(m,n), is unique for each base.Mathematically, it can be absorbed into the orthonormal Q matrix, whilestill maintaining its orthogonality, i.e. ifQ _(b)(m,n;r)=Q(m,n;r)b(m,n),

where Q(m,n;r) is the element of the matrix Q in the m+M(n−1)'th row andr'th column and where Q_(b)(m,n;r) is the element of the matrix Q_(b) inthe m+M(n−1)'th row and r'th column. Q_(b) is still an orthonormalmatrix.

The cross-correlation coefficient Q^(H){tilde over (d)} can be computedvery efficiently using fast Fourier Transform (FFT) techniques bycomputing,

${R_{qd}\left( {r;k} \right)} \equiv {\sum\limits_{l = 1}^{M_{c}}\;{{Q_{b}^{*}\left( {{m(l)},{{n(l)};r}} \right)}{\mathbb{e}}^{{- 2}{\pi j}\;{{lk}/M_{c}}}}}$where m(l) and n(l) are the unique integers in the intervals [1 M] and[1 N] respectively that satisfy l=m+M(n−1). The Q_(b) (m(l), n(l); r) isthe element from the l'th row and r'th column of Q_(b) provided thatM_(c), M and N are selected such that M_(c)=MN. The R_(qd)(r;k) is thek'th element of the vector Q^(H){tilde over (d)}, whose norm isproportional to the detection statistic from equation (A1). Referring toFIG. 1, FFT bank 12 computes each R_(qd) (r;k) corresponding to eachk'th preamble basis function. The norm evaluator 14 computes the normsand the corresponding detection statistic of equation (A1).

Fine Delay Synchronization

The present invention includes a robust technique for the detection andremoval of small delay errors between a remote unit and its base. Asdescribed later, the RU synchronizes its transmit and receive gates sothat the effective delay between the RU and the base is minimal. Inaddition, the RU of the present invention includes a set of equalizationgains that are applied to every bin to equalize out, in the frequencydomain, any residual signal delays. Any number of well-knownequalization techniques used in wireless communications can accomplishthe equalization process. See, for example, G. Santella, “A Frequencyand Symbol Synchronization System for OFDM Signals: Architecture andSimulation Results,” IEEE Transactions on Vehicular Technology, Vol. 49,No. 1, January 2000 and M. Speth et al, “Optimum Receiver Design forOFDM-Based Broadband Transmission—Part II: A Case Study”, IEEETransactions on Communications, Vol. 49, No. 4, April 2000.

The base receiver provides fine delay synchronization to remove anydelay errors that were not compensated by the RU delay compensationprocedure. Fine delay synchronization in the base receiver is based onthe following model in which a residual delay term is added to thedetection statistic in equation (A1) by modeling,

$\begin{matrix}{{\overset{\sim}{d}\left( {m,n} \right)} = {{\mathbb{e}}^{{- 2}{{\pi j}{({{m\;\delta} + \frac{{kM}{({n - 1})}}{M_{c}}})}}}{{b\left( {m,n} \right)}.}}} & ({A2})\end{matrix}$The δ term represents an unknown normalized frequency modeled as thepreamble frequency k/m_(c) plus an unknown delay offset δ₀, so that

$\delta = {\delta_{0} + {\frac{k}{M_{c}}.}}$If δ₀ is small, then a local search of the detection statistic in thevicinity of

$\frac{k}{M_{c}}$provides a highly accurate estimate of the residual delay error δ₀.Therefore the procedure to obtain δ₀ first estimates the preamble indexk, followed by the substitution of equation (A2) into equation (A1) toobtain the fine synchronization objective function as a function of δ.

The present invention provides a novel technique for rapidly computing δusing the Q matrix resulting from the QR decomposition 8 and of FIG. 1.For the following definition,

${{{\overset{\sim}{Q}}_{b}\left( {m,s} \right)} = {\sum\limits_{n = 1}^{N}\;{{Q_{b}^{*}\left( {m,{n;s}} \right)}{\mathbb{e}}^{2\pi\; j\;{{{kM}{({n - 1})}}/M_{c}}}}}},$the detection statistic can be written as,

$\begin{matrix}{{\rho_{d}(\delta)} = {\frac{1}{MN}{\sum\limits_{s = 1}^{K_{base}}\;{\sum\limits_{l = 1}^{M}\;{\sum\limits_{m = 1}^{M}\;{{{\overset{\sim}{Q}}_{b}^{*}\left( {m,s} \right)}{{\overset{\sim}{Q}}_{b}\left( {l,s} \right)}{\mathbb{e}}^{2\pi\;{j{({m - 1})}}\delta}}}}}}} & ({A3})\end{matrix}$

Least squares quadratic approximations of ρ_(d)(δ) and e^(2πj(m−1)δ)lead to efficient computations using the FFT. The quadraticapproximations are valid between any two adjacent preamble frequencies

$\frac{k}{M_{c}}.$The approximation of e^(2πj(m−1)δ) is c_(m)(δ)≈e^(2πjmδ). Substitutioninto the equation (A3) for the detection statistic gives,

${\rho_{d}(\delta)} \approx {{\hat{\rho}}_{d}(\delta)} \equiv {\frac{1}{MN}{\sum\limits_{s = 1}^{K_{base}}{\sum\limits_{m = 1}^{M}{{{\overset{\sim}{Q}}_{b}^{*}\left( {m,s} \right)}{\sum\limits_{l = 1}^{M}{{{\overset{\sim}{Q}}_{b}\left( {l,s} \right)}{{c_{m - 1}(\delta)}.}}}}}}}$

This computation can be performed in the ‘frequency domain’ to achieve

$\begin{matrix}{{\hat{\rho}(\delta)} = {\frac{1}{4M^{2}N}{\sum\limits_{q = 1}^{4M}{\sum\limits_{s = 1}^{K_{base}}{{{Q_{F}\left( {q,s} \right)}}^{2}{{c_{F}\left( {q\;;\delta} \right)}.}}}}}} & ({A4})\end{matrix}$The c_(F) and Q_(F) in the above equation are frequency domainrepresentations calculated as follows,

${c_{F}\left( {q;\delta} \right)} \equiv {\sum\limits_{r = {{- 2}M}}^{{2M} - 1}{{c_{r}(\delta)}{\mathbb{e}}^{\frac{2\pi\; j\;{qr}}{4M}}\mspace{14mu}\text{and}\mspace{14mu}{Q_{F}\left( {q;s} \right)}}} \equiv {\sum\limits_{l = {{- 2}M}}^{{2M} - 1}{{{\overset{\sim}{Q}}_{b}\left( {l,s} \right)}{{\mathbb{e}}^{\frac{2\pi\; j\;{ql}}{4M}}.}}}$The computation of Q_(F)(q;s) can serve double duty by using it todevelop the FFTs used in the preamble detection algorithm.

An efficient method for computing c_(F) is using a look-up table isdescribed as follows. The expansion c_(r)(δ)=α₀(r)+α₁(r)δ+α₂(r)δ² isvalid for the normalized frequency interval δε[a, b]. The c_(r)(δ) canbe calculated by computing the FFTs for each α_(j)(r) for each [a, b].The normalized frequency interval bounds are restricted to

${a = {{\frac{k}{M}\mspace{14mu}\text{and}\mspace{14mu} b} = \frac{k + 1}{M}}},$corresponding to consecutive preamble indices. The FFTs of everyα_(j)(r) of interest can be computed and tabulated in advance to producea look-up table. This look-up table is accessed for computingc_(F)(q;δ).

After computing c_(F) and Q_(F), the quadratic approximation in equation(A4) is optimized over the normalized frequency δ, providing an estimateof δ. The delay estimate δ₀, is found using the relationship

$\delta_{0} = {\delta - {\frac{k}{M_{c}}.}}$

Despreading Weight Computation

Despreading weight computation 20 of FIG. 1 is described herein. After acorrect preamble has been identified by preamble detection block 16 anddelay errors have been reduced by fine delay synchronization, a set ofdespreading weights w_(r) is computed corresponding to the detectedpreamble. The despreading weights can be computed using the results forthe preamble detection and fine synchronization error detection. After{tilde over (d)} has been estimated according to the model in equation(A2), the set of despreading weights corresponding to the detectedpreamble {tilde over (d)} is calculated according to the followingequation,w _(r) =R _(x) ⁻¹ Q ^(H) {tilde over (d)},

Referring to FIG. 1, the Q and R_(x) matrices are obtained from the QRdecomposition 8 of X_(p). The set of despreading weights w_(r)represents the minimum least squares linear beamforming weights for theset of ‘known’ preamble symbols transmitted. That is, w_(r) minimizes ofthe objective function,μ≡∥{tilde over (d)}−X _(p) w _(r)∥²

A different set of weights are computed for each of the K_(detect)preambles detected. The despreading weight vectors for all of thedetected preambles form the K_(detect) columns of the despread gainmatrix W_(r) output from the weight computation block 20.

Processing of the received data bearing symbols by the base receiver isnow described. Referring to FIG. 1, P/D DeMux 2 separates the conjugatereceived data corresponding to transmitted data symbols, X_(d), from theconjugate received preamble data. The weights W_(r) are applied to theconjugate received data X_(d) by matrix product block 22, which formsthe product X_(d)W_(r). This step is analogous to beamforming, so matrixproduct block 22 is also referred to as a beamformer. Delay equalizer 24removes any estimated delay errors from the output of matrix productblock 22. The following equation represents the weighting and delayequalization of a received data vector,{circumflex over (d)}(m,n)=e ^(−2πjmδ) ⁰ w _(r) ^(H) x(m,n).In the above equation, x(m,n) is a K_(base)×1 complex baseband receiveddata vector at frequency index m and time index n corresponding totime/frequency indices used by transmitted data symbols, δ₀ is the delayoffset corrected by the delay equalizer. The decoder 26, or codec,decodes the output of the delay equalizer to reproduce the reverse linktransmitted bit sequences.

Recursive Implementation of QR Decomposition

An alternative embodiment of QR decomposition block 8 of FIG. 1 providesa recursive implementation. The previously described QR decompositionand computation of the despreading weights by the weight computationblock 20 corresponds to the case of processing a single adapt frame, orblock of data, without using previous blocks of data. As described next,an embodiment of this invention includes block recursive and exponentialrecursive cases. Techniques of block recursion are described in D.Manolakis, et al, Statistical and Adaptive Signal Processing, MacGrawHill, 2000.

Let X₁ be the received data matrix for all previous blocks and let X₂ bethe data matrix received over the most current adapt block. The datamatrices include rows of received data vectors, which are the Hermitiantransposes of the complex received data. A QR decomposition has beenperformed on the X₁ data to date, produces an orthonormal Q₁ and anupper triangular K_(base)×K_(base) matrix R₁ such that,Q₁R₁=X₁.

It is desired to obtain the joint QR decomposition of the total datamatrix X_(T), which contains all the received data,

${X_{T} \equiv \begin{bmatrix}X_{1} \\X_{2}\end{bmatrix}},$so thatQ_(T)R_(T)=X_(T).

The new QR decomposition can be obtained from the much smaller augmentedmatrix,

$X_{A} \equiv {\begin{bmatrix}R_{1} \\X_{2}\end{bmatrix}.}$

The QR decomposition of X_(A) can be performed in a straightforwardfashion using any number of standard techniques. In a preferredembodiment Householder transforms are used since this technique canexploit the zeros in the upper triangular R₁ matrix.

A Householder transform is an orthonormal matrix of the form,H _(T) =I−2vv ^(H),for any unit-norm vector v. For arbitrary nonzero matrices a and b, aHouseholder transform can be obtained such that,

${H_{T}a} = {\omega\frac{a}{b}b}$for a unit modulus complex number ω.

This property can be used to design successive Householder transforms inorder to change X_(A), column by column into

$\begin{bmatrix}R_{T} \\0\end{bmatrix}.$By inserting zeros into the elements of v, the Householder transformscan be designed to operate on only the nonzero elements of a givencolumn vector, reducing the overall computational burden. TheHouseholder matrices generated by this process are multiplied out inreverse order, and the first K_(base) columns are retained to obtain theQR decomposition of X_(A), which can be written as

$\begin{matrix}{{{{\begin{bmatrix}T_{1} \\T_{2}\end{bmatrix}R_{T}} = {\begin{bmatrix}R_{1} \\X_{2}\end{bmatrix} = X_{A}}},}\quad} & ({A5})\end{matrix}$where

$\begin{bmatrix}T_{1} \\T_{2}\end{bmatrix}\quad$is the orthonormal Q matrix in the QR decomposition of X_(A). The Rcomponent of the QR decomposition of X_(A) is the same as R_(T). This isbecause of the uniqueness of the Cholesky factor of the auto-correlationmatrix,R _(T) ^(H) R _(T) =X _(T) ^(H) X _(T) =X _(A) ^(H) X _(A).

The matrix

$\begin{bmatrix}{Q_{1}T_{1}} \\T_{2}\end{bmatrix}\quad$is the Q component of the QR decomposition of X_(T) because of theuniqueness of the QR decomposition and the following relationships,

$\begin{matrix}{{{\begin{bmatrix}{Q_{1}T_{1}} \\T_{2}\end{bmatrix}R_{T}} = {\begin{bmatrix}{Q_{1}R_{1}} \\X_{2}\end{bmatrix} = {\begin{bmatrix}X_{1} \\X_{2}\end{bmatrix} = X_{T}}}},} & ({A6})\end{matrix}$where use is made of equation (A5).

The T₂ matrix is the component of the QR decomposition of the totalreceived data corresponding to the new data block X₂. This matrix canreplace the Q matrix in the recursive implementation. If an exponentialweighting is desired, then the following augmented matrix is used,

${X_{A} \equiv \begin{bmatrix}{\lambda^{\frac{N}{2}}R_{1}} \\X_{2}\end{bmatrix}},$where λ is the per-sample exponential delay factor, and N is the numberof rows (i.e. the number of samples) in the new data block X₂.

A result of using a longer time frame or recursive adaptation isimproved performance both for persistent signals and for any new signalsthat enter within a single block using a known or detected preamble.There is improved detection performance for new signals because thealgorithm naturally exploits both the FFT structure of the preamble andthe fact that the new signal is nonzero only in the new data block.

Persistent signals can be protected from the intrusion of new RUs byeither signal cancellation techniques or by decreasing λ so that thepast history does not prevent the weights for the current block fromcanceling any new signals.

Base Transmitter Spreading Operation

The present invention exploits channel reciprocity to formulatespreading weights for transmission. When there is channel reciprocity,the channel matrices between the base and the RU for the forward(downlink) and reverse (uplink) directions are transposes of oneanother. As previously stated, a preferred embodiment of the presentinvention uses a time division duplex (TDD) protocol. For a TDDprotocol, both the forward and reverse links share the same set offrequency bins. Transmission using forward link spreading weights thatare a scaled version of the reverse link despreading weights willgenerate a beam pattern that places nulls in the direction of RUs thatare not the intended recipients, and gains in the direction of RUs thatare the intended recipients. FIG. 2 illustrates an example of abeamforming pattern 42 with a peak in the direction of a signal ofinterest 46 and nulling in the direction an interferer 44.

In a preferred embodiment, the spreading weights g_(f) used fortransmission on the forward link are determined by scaling the receivedespreading weights w_(r) as follows,g _(f) =k _(fwd) w _(r)*.  (A7)

The scaling constant k_(fwd), is used throughout the network and ischosen to select the desired mean transmit gain for each link from abase to a RU. For a TDD protocol, the reverse link channel will benearly identical to the forward link channel, after calibrating out anycomponent differences between the transmission and reception hardware inthe base and the RU. For this situation, spreading weights g_(f) thatare optimal, based on a minimum mean square error criterion, are ascaled version of the despreading weights w_(r).

FIG. 3 illustrates a preferred embodiment of the base transmitterspreading operation 50. The spreading operation includes combining aknown preamble sequence p₀ with the desired transmit data d₀ atconcatenator 52. For example, the known preamble sequence p₀ can be theproduct of a pseudo-random constant modulus base code and an orthogonal(within a given cell) preamble sequence. The total number of symbols,including both preamble and information symbols, is mapped to adesignated set of N_(d)+N_(p) symbols within an adapt frame andfrequency partition. The spreading multiplier 54 spreads the symbolsover all K_(RU) spreading frequencies and K_(antenna) sensors using thecomplex spreading gains g_(f).

FIG. 4 illustrates a spreading of symbol map 60 resulting from thespreading operation 54 of FIG. 3. Referring back to FIG. 4, each of theK_(Base) complex weights multiplies each symbol d(m,n). For example,multiplier 64 a multiplies each symbol by the complex weight g_(f)(1)and maps weighted symbols in frequency and time as shown in the mapping62 a. Analogous symbol mappings 62 b and 62 c result from spreadingmultiplications 64 b and 64 c by spreading weights g_(f)(2) andg_(f)(K_(Base)), respectively. For this example, the number of timesamples is four. Combining the preamble symbols and the data symbols ismost effective if the preamble symbols are spread evenly among theavailable frequency bins in a partition.

Forward Link Power Control

A preferred embodiment of the base transmitter provides forward linkpower control described herein. The desired gain from a signaltransmitted from a RU through a reverse link spreader of FIG. 6, achannel, and the base receiver's despreader of FIG. 1 is unity. This ismodeled asw _(r) ^(H) H(m)g _(r)≈1,where g_(r) is the RU transmitter's spreading gain and H(m) is theK_(base)×K_(RU) matrix channel model as a function of frequency index m.H(m) has the block diagonal form,

${H(m)} = {\begin{bmatrix}{h\left( {f_{1},m} \right)} & 0 & L & 0 \\0 & {h\left( {f_{2},m} \right)} & 0 & M \\M & M & O & 0 \\0 & 0 & L & {h\left( {f_{K_{RU}},m} \right)}\end{bmatrix}.}$

The frequency f_(k) represents the start of the k'th spreading frequencyused by a given partition. The index m is the m'th frequency bin offsetinto the partition. Each h(f_(k), m) is a K_(antenna)×K_(antenna,RU)matrix representing the channel transfer function between a RU and abase. K_(antenna) is the number of sensors used by a base, andK_(antenna,RU) is the number of sensors used by a RU. Nominally, thenumber of number of sensors used by a RU is one; however, alternativeembodiments of the present invention may include multiple sensors at aRU. The channel includes the effects of wave propagation through spaceand any filtering operations that may occur in either the transmitter orreceiver RF components.

The reverse link power control is effected by setting the bulk transmitgains so that the mean received power in a partition is equal to adesign target of κ_(rev),

$\sqrt{\left\langle {{{H(m)}g_{r}}}^{2} \right\rangle_{m}} = {\kappa_{rev}.}$

A formula for mean received power is based the relationships,1≈|w _(r) ^(H) H(m)g _(r) |≡ε∥w _(r) ∥∥H(m)g _(r) ∥≈ε∥w_(r)∥κ_(rev).  (A8)

The term ε is a system design parameter related to system efficiency.Its maximum value is 1, but is typically smaller due to array loadingfrom other interferers, multipath and partition bandwidth. A moretypical value of ε is −10 to −11 dB. In the noise-free case and in theabsence of time or frequency dispersion, ε can achieve its maximum ofunity since the optimal least squares despreading gains w_(r) will tendto be proportional to the received aperture H(m)g_(r). When thedifferential delay of the multipath is small relative to the inverse ofthe partition bandwidth, and after the direct path delays have beencompensated, the received aperture is nearly independent of thefrequency bin index m within a given partition.

From equations (A7) and (A8) a formula for the norm of the forward linktransmit gains and a design formula for κ_(fwd) is obtained as follows,

$\begin{matrix}{{{g_{f}} \approx \frac{\kappa_{fwd}}{ɛ\;\kappa_{rev}}},{\kappa_{fwd} \approx {{g_{f}}ɛ\;\kappa_{rev}}}} & ({A9})\end{matrix}$

When the transmit power is specified due to power amplifier operatingcharacteristics, FCC regulations or the economics of the desired cellradius, then the correct retrodirective gain κ_(fwd) can be specifiedusing equation (A9).

An alternative method is to set the magnitude of each weight vector tothe same constant k_(f), as follows,

$g_{f} = {\frac{w_{r}^{*}}{w_{r}}k_{f}}$This method assumes channel reciprocity.

RU Receiver Despreading Operation

FIG. 5 illustrates a RU receiver despreading processor 70. Definitionsof the signal parameters involved are provided below.

-   P: N_(p)×1 conjugate preamble vector, unique for a given RU.-   X_(p): N_(p)×K_(RU) conjugate received data at a RU over the    time/frequency indices used by the known preamble.-   X_(d): N_(d)×K_(RU) conjugate received data at a RU over the    time/frequency indices used by the transmitted data symbols.-   Q: N_(p)×K_(RU) whitened received data (orthonormal columns) after    the QR decomposition of X_(p).-   R_(x): K_(RU)×K_(RU) Cholesky factor of X_(p).-   R_(qd): K_(RU)×1 cross-correlation between the whitened data and the    known preamble vector.-   w_(f): K_(RU)×1 despreading gains for the RU.

All of the matrices and dimensions described above are quantities usedinternally by the RU digital signal processor(s) and are different thanthose described for the base receiver in FIG. 1, although they playanalogous roles. The RU despreading operation now described applies to asingle partition. When multiple partitions are used, each partition hascorresponding despreading weights, which are applied to the receiveddata in the given partition. The received data are first down-converted,digitized and broken into partitions. A partition of data is separatedinto a set of received vectors associated with the transmitted preamble,X_(p), and those vectors associated with the transmitted informationsymbols X_(d). The rows of X_(p) contain the Hermitian transposes of aset of received K_(RU)×1 data vectors, x(m_(i), n), where m_(i) is thei^(th) frequency bin containing a preamble symbol.

FIG. 5 is a block diagram of a remote unit receiver 70. Thepreamble/data demultiplexor P/D Demux 72 separates the input signal intopreamble data X_(p) and transmitted information data X_(d). The RU'sconjugate preamble vector P can be stored in a storage disk 74 or inmemory. The received preamble data X_(p) is whitened using a QRdecomposition 76, such that Q R_(x)=X_(p), where Q is an orthonormalmatrix. The multiplication block 78 combines the conjugate preamblevector P with the whitened received preamble matrix Q to give thecross-correlation R_(qd).

The weight computation block 80 computes despreading weights w_(f). Thedespreading weights w_(f) optimize a simple least squares performancecriterion. They are computed according to the formula,w_(f)=R_(x) ⁻¹Q^(H)P.The multiplication block 82 applies despreading weights w_(f) to thedata vectors in X_(d) associated with the information symbols to form avector of despread information symbols, according to the formula,{circumflex over (d)}=X_(d)w_(f).The output of the multiplication block 82 is processed by codec 84 toobtain the transmitted information bits.

The dimension of the despreader in this example is K_(RU), the frequencyspreading gain factor. In general, a RU may have multiple sensors,increasing the degrees of freedom and improving its ability to cancelinterference. For some applications, however, it is advantageous tominimize the complexity of the RU by minimizing the degrees of freedomused in the despreader. For TDD systems, the base can manage themajority of the complexity needed to provide interference excision.

RU Transmitter Spreading Operation

FIG. 6 illustrates an embodiment of an RU transmitter 85. Theconcatenator 86 combines a known preamble sequence p₀ with the transmitdata d₀. The combined preamble and transmit symbol sequence has a totallength of N_(d)+N_(p). The preamble sequence p₀ is the product of aconstant modulus base scrambling code, b(m,n), and a unique orthogonalpreamble sequence previously assigned to the RU.

Alternative embodiments do not use a base scrambling code. Forembodiments using Hadamard basis functions, for example, the preamblesequence assigned to the RU is based on a Hadamard basis function.

The combined sequence is mapped to a designated set of symbols within anadapt interval and frequency partition. Spreading operation 88 spreadsthe symbols over all K_(RU) spreading frequencies by multiplying withcomplex spreading gains g_(r). The spreading operation 88 reproduces thetransmitted symbols in K_(RU) widely separated frequencies for eachsensor and scales each symbol by a complex constant.

FIG. 7 illustrates a spreading of symbol map 90 resulting from thespreading operation 88 of FIG. 6. Referring back to FIG. 6, each of theK_(RU) weights multiplies the symbols d(m,n). For example, multiplier 94a produces symbols weighted by the complex weight g_(r)(1) and mapped tofrequency bins and time as shown in mapping 92 a. Multipliers 94 b and94 c produce symbol maps 92 b and 92 c using weights g_(r)(2) andg_(r)(K_(RU)), respectively. Combining preamble symbols and the datasymbols is most effective if the preamble symbols are spread evenlyamong the available frequency bins in a partition.

Closed Loop Power Control

Referring back to the retrodirective spreading gain relationship inequation (A9), the forward link power is indirectly controlled bycontrolling the reverse link transmit power. A simple technique formaintaining reverse link power control is to monitor the gain of thereverse link spreading weights at the base station. Based on systemoperating parameters and link budget, target values are established forforward link transmission power and the norm of the forward linktransmission gains ∥g_(f)∥ can be determined. This allows an estimate ofthe target value for ∥w_(r)∥≡η based on equation (A7). The power controlmethod preferably maintains and overall transfer function gain of unity,as indicated in equation (A8).

By monitoring ∥w_(r)∥ at the base and comparing it to a set ofpredefined thresholds η⁻, η₊ such that η⁻≦η≦η₊, it is determined whetherthe despreading weight power needs to be changed by an incremental gainchange parameter γ_(I), which is adjustable. If the changes in transmitgains are kept small, for example in 1 dB increments or decrements, thena simple two bit return message can be sent to the RU from the base toindicate the desired changes in power control.

FIG. 8 gives a flow chart for a closed loop power control method 100. Acalculation block 102 calculates the norm of the base despreadingweights w_(r). A first comparator 104 compares this norm with the lowerthreshold η⁻. When the result of the first comparator 104 is “yes”, thebase sends decrease-power bits to the RU according to a decrease-powerblock 106. At increase-gain block 108, the gain of the base despreadingweights is increased, and at decrease-power block 110 the powertransmitted by the RU is decreased. The incremental gain changeparameter γ_(I) is used by both increase-gain block 108 and thedecrease-power block 110.

When the result of the first comparator 104 is “no”, a second comparator112 compares this norm with the upper threshold η₊. When the result atthe second comparator is “yes”, the base sends increase-power bits tothe RU at block 114. At decrease-gain block 116 the gain of the basedespreading weights is decreased, and at an increase-power block 118 thepower transmitted by the RU is increased. The on the incremental gainchange parameter γ_(I) is used by both the decrease-gain block 116 andthe increase-power block 118.

When the result of the second comparator 112 is “no”, the base sendunchanged power bits to the RU according to a no-change power block 120.

When despreading weight update intervals are longer than the powercontrol interval or when longer block or exponential averaging times areused, the despreading gains are adjusted to compensate for the newtransmit gain powers. In this case, the corresponding cross-correlationcoefficients are adjusted in a similar way, since the coefficients andweights are proportional.

An alternative calculation of RU transmit weights for weights having thesame magnitude is as follows. The base computes the incremental gainchange and sends the RU the power change bits. The RU in turn convertsthese bits into the desired transmit power, k_(r), and converts the RUreceive weight vector, w_(f), to the RU transmit weight vector, g_(r),using,

$g_{r} = {\frac{w_{f}^{*}}{w_{f}}k_{r}}$

Alert Control Channel

An embodiment of a control channel is the alert control channel isdescribed herein. An alternative to the alert control channel, theaccess channel, is described later. One purpose of a control channel isto initialize communication links. Initializing communication on theforward link can be difficult since there is little or no informationavailable to a base station for determining spreading weights used tonull interference from other remote units. To reduce cost andcomplexity, most RU implementations will have a small number of sensors,typically one, and may have one or two degrees of freedom cancelinterference and enhance the signal of interest from the base. Forexample, the bases have 16 sensors and 2 spreading frequencies for atotal of K_(base)=32 degrees of freedom. The RU has 1 sensor and 2spreading frequencies for K_(RU)=2 degrees of freedom. It isadvantageous for the base transmitter weights to provide interferencemitigation since the base has more degrees of freedom. To traintransmitter weight, a base can request that a particular RU transmit amessage that it can use to compute initial transmit weights. Oneapproach is for the base to broadcast a request message to all RUs.Another approach is to maintain a low data rate link for requestmessages to each RU considered active.

An alert channel, or alert channel cache, is a set of frequency binsdedicated to the transmission of control information used to initiatecommunication links. For initiating communication links, base stationrequests a particular RU to transmit a message that can be used by thebase station to compute transmit weights for that RU. The base uses thealert channel to maintain a low data rate link to each active RU. Thebase sends a few bits to the RU on a forward link alert channel,indicating that it wishes to transmit data packets to the RU. The RUwill then respond by transmitting a weight training message (WTM). TheWTM is a known preamble that the base uses to compute a set of transmitweights.

The alert channel supports other control functions. These includeindicating the partitions for transmission, the number of frames of datato be transmitted, power control information for controlling powerlevels on both the alert channel and on the traffic bins, and RUperformance and status information.

The RUs using the alert channel are the most active users currently inthe network. In this sense, the alert channel plays a role similar to acache in computer architecture. When a base wishes to transmit to a RU,there is a high probability it can signal the desired RU using the alertchannel.

FIG. 9 illustrates an example time/frequency resource allocation for analert channel cache 121. The alert channel in this example uses 16frequency bins 122 a through 122 d and 124 a through 124 l and four timeindices 126. Channels 124 a through d are referred to as alert bearerchannels. Four training bins, or training channels, 122 a–d, areallocated for new users to enter the alert channel network. A separateentry channel “e”, or current entry channel, is cycled through the 12alert bearer channels 124 a–l. For this example, the current entrychannel occupies frequency bin 124 j. A user number 128 indicates that aparticular RU is using a channel.

Each RU transmits a preamble sequence on the four training bins 122 a–d.After a suitable number of adapt frames has passed, despreading weightsare trained for each RU in the alert channel. Transmission then switchesto the current entry channel 124 j. Once the signals have transitionedto the current entry channel 124 j, the entry channel number isincremented so that new alert bearer channel, for example 124 k, willadd signals. The applies the despreading weights to data received in thealert channel.

The number of users allowed per channel may vary and channels may befurther specialized. Up to M_(base) users may be added to each alertbearer channel 124 a–l. A channel may be divided into smaller, lowerrate channels for specialized transmissions such as voice transmissionsin an internet protocol (IP) network. For example alert bearer channel124 c, is time division multiplexed to support four users.

FIG. 10 illustrates an alert channel protocol method 130. In step 132,transmission begins on the current entry channel. Step 134 checks forthe value of e=12, for this example. More generally, this step checkswhether e equals the number of alert bearer channels. If the result is“yes” then the value is reset to 1; otherwise, the value is incremented.A transmission 136 is made to an active RU. If there is no time out,then the preamble is transmitted 138 followed by continued transmissions132 on the current entry channel 132. After an inactive RU time out 140,transmission of a preamble is begun from a new RU in step 142. Apreamble is transmitted on training tones 144 for a number of frames,eight for this example. Next, RU ID and control data are transmitted 146followed by transmission 132 on the current entry channel.

Active User Entry

When an inactive RU has data to transmit to a base, it can begin doingso over the bearer channels and the training bins in the alert channelcache. Initially, the RU 218 a 1 transmits preambles so that the basecan adapt a set of despreading weights. The base can use two techniquesto determine which of the RUs 218 a 1–218 a 9 are entering.

The first technique includes having a fixed set of orthogonal preamblesreserved for each partition of each base 216 a–216 c for transmissionover the alert channel training bins. The preamble symbols are selectedfrom an orthogonal basis set that admits fast transforms, such as FFT orHadamard basis. Several basis sets may be maximally separated by a unitmodulus scrambling code in order to increase the number of availablepreamble sequences and minimize the probability of collision. Fordynamically assigned preambles, after the base 216 a has transmitted thepreamble sequence, the RU 218 a 1 responds by transmitting a heavilyencoded identifier, or RU ID, and control information over severalframes. The base 216 a can analyze the RU response for bit errors anddetermine whether to send an acknowledgement. The base can send anacknowledgement over several alternative channels, including trainingbins in the next few frames, the alert bearer channels after userstransfer to the current entry channel or frames borrowed from theforward link initiation transmit opportunities.

In the second technique, the RU 218 a 1 enters on an alert bearerchannel by simply starting to transmit preamble symbols and data. Thebase detects the preamble using a preamble detection algorithm.Associated with the initial reverse link entry, is a forward link returnchannel containing control information from the base. The controlinformation designates the preamble the RU should transmit on the alertchannel. After receiving this control information, the RU 218 a 1 canenter the alert channel by transmitting the designated preamble. In thisscenario, a RU ID would be unnecessary.

These two techniques have different performance tradeoffs. With thefirst technique, there would be greater latency for initial RU entry onan available alert channel. With the second technique, there would beadditional loading on the alert bearer channels. Also, if the alertbearer channels use soft contention, additional handling of contentionissues would be required.

After transmission of preamble data, the RU transmits ID information andthen moves all transmission to the current entry channel, for example,channel 124 j in FIG. 9. The entry channel number is then incremented,modulo the number of available entry channels, which is twelve in theexample of FIGS. 9 and 10.

Once the RU is active, the base can compute its despreading weightsusing decision-directed adaptation. Decision-directed adaptation usesthe output of a symbol decoder to estimate the transmitted symbols. Thebase uses the estimated symbols to compute a cross-correlation R_(xs).The base then computes despreading weights according to a minimum meansquare error (MMSE) criterion as follows,w_(a)=R_(xx) ⁻¹R_(xs),where R_(xx) is the received data auto-correlation matrix. When the RUis transmitting symbols on the training bins, the transmitted symbolsare known by the base and do not need to be estimated.

The alert channel provides a low data rate circuit for two-waycommunication between the base and the RU. Because the transmit gains onthe forward link can be chosen retrodirectively as in equation (A7), theforward link transmission will be efficient, allowing up to nine usersto share the channel when K_(base)=32. The efficiency increases when theRU also chooses its transmit gains retrodirectively. This efficiencyincrease is accompanied by increasing RU complexity, since thedifferences between the transmitter and receiver hardware at the RU mustbe compensated.

While a RU is active in the alert channel cache, the base can use thechannel to indicate when the RU should transmit weight training messagesfor a forward link data transmission. The RU can also use the alertchannel cache to transmit performance statistics and power controlinformation on the reverse link. When the RU does not have data totransmit on the alert channel, it still transmits weight trainingmessages to enable a forward link transmission from the base.

Inactive User Exit

After the RU has been using the alert channel for a while, its activityon the channel may decrease. This occurs when the user is no longerusing his data modem or the user is processing data that has alreadybeen transferred, such as reading a downloaded web page. At this pointit is desirable to remove the user from the alert channel.

The decreased activity can be detected by using a simple activitythreshold. The packet transfer rate can be measured and when it dropsbelow a pre-defined level the RU is informed over the alert channel thatit is being removed from the channel and is now considered inactive.

This strategy can modified to support lower data rate CBR (constant bitrate) services. These services must be identified and appropriateactivity thresholds must be set for the type of service employed.

Alert Channel Load Leveling

In order to prevent one alert bearer channel becoming overloaded whileothers remain underloaded, a simple load leveling algorithm is applied.The loading on each alert bearer channel is kept as even as possible bydirecting the channel with the largest number of users to offload one ofits users to the current entry channel 124 j of FIG. 9. For example, ifthe active tone with the largest number of users has two more users thanthe current entry channel, one of its users is offloaded, such as theone with the lowest MSE.

The base informs the selected RU of its status by transmitting controlbits over the forward link alert channel. The RU then beginstransmitting its preamble symbols in the training bins and data in itscurrent alert bearer channel. Other RUs may also be transmittingpreambles in the training bin. The transmitted preamble of the selectedRU can use a separate code so that it will not collide with others inthe training bins. The RU transmits any necessary control data in thealert bearer channel. After the transmission on the training bins isfinished, the selected RU begins to transmit on the current entrychannel with the other RUs. The selected RU simultaneously ceasestransmission on the old maximally-loaded channel. This effects atransfer from the most loaded channel to the current entry channel.

Because of its fixed schedule, the current entry channel is known toevery user and every base in the network. Therefore, current entrychannel information need not be passed between the base and RU.

Base Initiated Transmission

In certain cases, the base initiates transmission with an inactive RU.For example, paging and e-mail services require the transfer ofinformation on a periodic basis at various intervals, such as every tenminutes, hourly or daily. The base uses the alert channel training binson the forward link to initiate these transmissions.

The base 216 a transmits a symbol sequence unique to the RU 218 a 1 withwhich it desires to communicate. Each of the inactive RUs 218 a 2–218 a9 cross-correlates its unique code against the received data transmittedfrom the base to determine whether it is being paged by the base 216 a.If the computed detection statistic of a RU 218 a 1 exceeds a threshold,then the RU 218 a 1 accepts the page request of the base 216 a andbegins transmission on its home partition. The RU 218 a 1 transmits aknown weight training message, which the base uses for adapting itsforward link transmission gains. The RU 218 a 1 also begins transmissionon the alert channel training bins for entry into the alert channelcache.

The detection statistic used by each RU 218 a 1–218 a 9 is of the form,

$\rho_{d} = \frac{c^{H}{P\left( X_{a} \right)}c}{c^{H}c}$where X_(a) is a complex matrix whose rows are the Hermitian transposesof the K_(RU)×1 received data vectors over the alert channel trainingbins. The unique detection code for each RU 218 a 1–218 a 9 isrepresented by the vector c. The dimension of c is equal to the numberof available training bins in a given partition. For the example of FIG.9, the number of available training bins is sixteen.

A set of unique detection codes can be chosen using sphere packing codesto provide maximum separation. The codes can be generated using knownlattices or computer aided numerical optimization techniques. The codesdo not require a special structure for the purposes of encoding ordecoding since each RU tests only the code assigned to it. The RUcomputes the detection statistic only when it is otherwise dormant or inan inactive state. The computations do not impact the RU while it isactive.

The performance of forward link initiation can be enhanced by the properchoice of forward link spreading gains. During the course of normaloperation, the base makes measurements of the RU to base channel overthe alert channel bins. The base computes a cross-correlation vectorR_(xs), which is a measure of the base receive aperture vector. The mostrecent aperture estimates can be saved in a database at the base. Thespatial component of the apertures should remain invariant forreasonably long periods of time. The base can set the transmit gains tobe proportional to R_(xs), scaled to the desired transmit power. Thisenhances the gain in the direction of the RU of interest by a factor aslarge as K_(base).

Periodic User Strategies

Users of voice, broadcast video, video conferencing and similarapplications will establish links that have constant bit rates (CBR) andfairly regular periodic packets of data. A different strategy for lowerdata rate applications, such as voice, will provide efficient use ofsystem resources. For example, when a large number of voice users isanticipated, adding time division multiple access (TDMA) slots to eachfrequency bin can increase the number of channels available in the alertchannel. This example is illustrated in FIG. 9. The alert bearer channel124 b has four separate channels, each with an independent user. Thechannels are separated in time. The base has a set of despreadingweights for each of the four channels.

For the example of FIG. 9, adding TDMA allows for a factor of up to fourincrease in the number of users that can be active in the alert channelcache. The increase in users is achieved at the expense of decreasingthe bit rate for each of the CBR alert channel links. In practice, afixed percentage of the frequency bins would be allocated for lower rateCBR channels. Since a CBR link will remain active longer and itsparameters are sufficiently time invariant, the RU can assume a defaultpartition allocation and a default number of packets to transmit. Inthis situation, the RU receives only a few bits to indicate when tobegin transmission and for controlling the alert channel itself. Thisaccommodates the reduced bit rate of a CBR alert channel.

For RU entry, each TDMA style CBR alert channel is assigned its ownentry number on a network wide basis. A RU entering on a CBR alertchannel transmits only within its TDMA slot once it has successfullyentered on the training bins. The system planner uniformly distributesthe CBR channels evenly among the available entry channel numbers tominimize the wait for entry into either a CBR (low bit rate) orundefined bit rate (UBR) or high bit rate alert channel.

An alternative method for handling a large number of low bit rate CBRusers is a reservation scheme wherein the user simply agrees to transmithis data periodically in a predefined partition at predefined times.Such a user is left out of the alert channel cache so that resources arenot wasted on maintaining the user's status. The operation of such achannel is similar to the bearer channel cache described next.

Bearer Channel Cache

The concept of the alert channel cache can be extended to include all ofthe bearer channel resources. In such a system, every partition wouldfunction similarly to an alert channel. Upon entering the system, the RUtransmits on a set of training bins contained within the partition it isentering.

FIG. 11 illustrates an example of time and frequency allocation for abearer channel cache 147 distributed in partitions of the bearer channelresources. For TDD transmission, every RU 218 a 1–218 a 9 and every base216 a–216 c alternate between transmit time periods 149 and receive timeperiods 151. In a given partition 148 a–148 c, the training bins 152a–152 d are evenly distributed over the available frequency bandwidth.The training bins 152 a–152 d carry preamble symbols that are used totrain despreading weights. It is advantageous to stagger the entryopportunities 152 a–152 d from one partition 148 a–148 c to the next.With enough partitions this will make it possible for a user who desiresaccess to the network to enter in any given frame. In addition to thetraining bins, bearer channels 150 a–c can be designated as entrychannels in a similar fashion to the entry channels of the alert channelcache.

A given user may be in one or more partitions depending upon the neededbandwidth. Bandwidth growth can correspond to the dynamic bandwidthallocation schemes inherent within the internet protocol (IP) orbandwidth can be assigned based on the measured growth of channelutilization. Partitions of varying bandwidths, are provided to supportlower data rate CBR services. Bandwidth allocations may be based onfrequency or on time. Using Time Division Multiple Access (TDMA), wherea user transmits on periodic time slots facilitates changing bandwidthbased on time.

The nominal use for the entry bins in the bearer channel cache issimilar to the functioning of the training bins in the alert channel.Newly activated RUs transmit preambles in the entry bins along with anyexisting users in the partition. After a fixed period, sufficiently longto train despreading weights, all RUs switch to the new weightsdeveloped on the entry bins and begin transmitting on the data bearingslots of the partition.

Subsequent adaptation of the despreading weights is achieved usingdecision-direction algorithm. The decision-direction can also occurafter trellis decoding or block decoding. Since despreading weights areavailable at all times for the data bearing slots there is no latencyincurred by computing new weights after obtaining symbols from theoutput of the decoder. The symbols are used for the purpose of computingthe cross-correlation vector R_(xs). The available weights are appliedto the data first.

FIG. 12 is a block diagram for the decision-direction method 153. Areceived signal is down converted 154 followed by analog-to-digitalconversion 156. Despreading weights 158 are then applied followed bydecoding 160 to produce output bits. The output bits are re-encoded andmapped to the constellation 162 to produce a received symbol estimate.Cross-correlations calculation 164 of the received data and estimatedsymbols forms R_(xs) and autocorrelation calculation 166 of the receiveddata forms R_(XX). The compute new weights block 168 uses R_(xs) andR_(XX) to form new weights W′. The new weights will be applied to thenext data block.

Independent Downlink/Uplink Layout

The Independent Downlink/Uplink (IDU) channel layout method usesmultiple channels at different symbol rates to support the transmissionof packet data. This method separates the uplink communications channelfrom the RU to the base from the downlink channel from the base to theRU. The advantage is that the loading due to multiple users performinguplink transmission has no effect on users performing downlinktransmission. This is achieved at the cost of bandwidth to support theforward link control (FL-C) and reverse link control (RL-C) channels.These channels must have sufficient bandwidth to support weight trainingmessages (WTM). A WTM is a set of known preamble symbols transmitted forthe purpose of allowing either the base or the RU to adapt a set oftransmit weights.

FIG. 13 illustrates the channel functions for the IDU method 169. A base170 communicates with a RU on the downlink channel 172 and on the uplinkchannel 174. The adaptation process exploits channel retrodirectivityfor TDD systems so that the reverse link channel will be nearly the sameas the forward link channel. As described earlier, the transmit weightsare set to a scalar multiple of the receive weights. The transmitweights minimize the energy transmitted to unintended recipients.

The base signals a RU to enter the network using a forward linkinitiation channel (FLI). The FLI is used primarily when the base hasdata to transfer to a RU that is not actively transmitting in thenetwork.

FIG. 14 gives ping diagrams for initiating data transfer using the IDUmethod. For the forward link initiated transmission 180, when data areavailable at the base 176, to be transmitted to the RU 178, the base 176sends a bandwidth allocation message (BAM) 177 a to the RU 178 over theforward link alert (FL-A) channel established for that link. Thismessage contains the size of the desired packet, which frequency binsare needed to for the transmission and the quality of service. The RU178 responds to the BAM by transmitting a succession of weight trainingmessages (WTM) 179 a on the reverse link control channel (RL-C). Themessages 179 a are used to train the transmit weights that the base willuse to transmit data on the forward link bearer channel (FLB). It isassumed that there is a fixed and known latency between the WTMtransmission on the RL-C and its associated FLB transmission 177 b.After the designated number of data frames have been transmitted, the RU178 sends an acknowledgement (Ack) 179 b to the base by “banging” in onthe designated RU's home partition. This uses the soft contentionapproach described earlier.

For reverse link initiated transmission 182, RU 178 can begin datatransmission immediately on its home partition using soft contention toenter the network. The initial data frame 179 c also contains controlinformation describing how much reverse link data needs to betransmitted, quality of service, etc. The base 176 takes the requestedtransmission information and schedules the use of its resources. Thescheduled information is conveyed by a BAM message 177 c on the forwardlink alert (FL-A) channel. After this the RU 178 begins transmission ofdata 179 d in the partitions and for the duration indicated by the BAMmessage. The RU 178 will use an agreed upon preamble message to trainthe base despreading weights. After each transmission of a data frame,the base 176 responds by sending an acknowledgment 177 d on the forwardlink control (FL-C) channel.

In the IDU method, the WTMs on the RL-C support the FLB channel byproviding training symbols for adaptation of the FLB transmit weights.Similarly the reverse link bearer channel (RLB) supports the transmitweights for FL-C transmission. The base uses the preamble symbols thatare transmitted with the RLB bearer symbols to train the despreadingweights, which are then used to formulate the forward link transmitgains for the FL-C. Thus the high data rate channels are coupled withthe low data rate channels. However the RL-C/FLB pair is independent ofthe RLB/FL-C pair, and the shared loading on one set of channels doesnot effect the shared loading on the other set of channels.

Coupled Downlink/Uplink Layout

For the coupled downlink/uplink layout (CDU) every FLB transmission issupported with WTMs transmitted on the RLB. The RL-C is carried by theRLB and the FL-C is carried by the FLB. The CDU layout does not separatethe coupling between the FLB and RLB. FIG. 15 gives a channel diagramfor the CDU layout 183 for a base 184 communicating with a RU 186.

An advantage of the CDU method is that a separate RL-C for supportingWTMs is not needed. This saves bandwidth on the reverse link. The savedbandwidth can accommodate additional bearer traffic, which increases themaximum throughput on a given link. The CDU traffic model is alsosimpler since fewer independent resources are managed. A disadvantage isthat any loading on the FLB also loads the RLB because WTMs aretransmitted on the RLB to train the transmit weights used for the FLBtransmission. This disadvantage is offset by the fact that typicalreverse link transmission is a fraction of forward link transmission formany important uses, such as internet traffic, broadcast video or audio.As a consequence, the additional loading caused by reverse link trafficfor the transmission of WTMs on the RL-C/RLB is usually not a factor.

FIG. 16 gives ping diagrams for initiating data transfer using the CDUmethod for a base 188 and a RU 190. For forward link initiated datatransfer 192, the base 188 transmits a bandwidth allocation message(BAM) 189 a over the forward link alert channel (FL-A) established forthat link. The BAM designates partitions and transmit time for the RU.The RU 190 then uses its bearer channel (RLB) to transmit a series ofweight training messages (WTMs) 191 a to support the forward linktransmission. After a known and fixed latency, the base has used thereverse link WTMs to generate a set of transmit weights which it uses totransmit forward link data 189 b on the FLB channel. After all the dataframes have been transmitted as specified by the BAM message, the RU 190transmits an acknowledgement 191 b on its home partition using an agreedupon preamble sequence for training base despreading weights.

For a reverse link initiated data transfer 194, the RU 190 transmits aninitial packet and bandwidth and quality of service information (QOS)request 191 c in its home partition. This uses the soft contention entryapproach described earlier. The base 188 processes this request andallocates bandwidth according to its scheduler's protocols. It thenissues a BAM 189 c on the FLB in the RU's home partition. The RU 190 canthen transmit data 191 d on the RLB within the partitions designated bythe BAM message. Each data frame elicits an acknowledgement 189 d on theFLC, which is carried by the FLB.

When an error is detected in a data frame, a re-send is requested in theacknowledgement message.

Hybrid Layout

The hybrid layout method combines aspects of both the CDU and the IDUmethods. The hybrid layout method is increases the bandwidth of the RL-Cof the IDU design until it can carry smaller data rate messages such asacknowledgments or voice packets. This channel is referred to as RL-B1.Similarly the data rate of the FL-C is increased until it can carry lowdata rate messages, and it is referred to as FL-B2. FIG. 17 gives achannel diagram for the hybrid layout 195. A base 196 communicates witha RU on the downlink channel 198 and on the uplink channel 200.

The hybrid layout is similar to the IDU in that high data rate channelsare coupled with lower data rate channels, i.e. FL-B1/RL-B1 andRL-B2/FL-B2, while still providing independent loading on the two pairs.By increasing the data rate of the FL-C to that of the RL-B1, themaximum allowable data rate for reverse link transmission has increasedto the sum of the RL-B1 and RL-B2 rates.

The addition of smaller rate channels has another positive effect. Thefragmentation efficiency of the overall system improved because of thepresence of the smaller data rate channels. This prevents the waste ofprecious system resources when small data packets, such asacknowledgments, have to be carried on high bandwidth channels. Inhybrid layouts, smaller packets can be hosted on the RL-B1 or FL-B2channels.

The ping diagram for the hybrid layout is identical to the diagram forthe CDU layout. Scheduling algorithms for the allocation of resourcescan accommodate the differing channel rates on each partition.

Strategies to Increase RU Bandwidth

In order to increase the forward link bandwidth available for a givenRU, it is necessary to train base transmit weights for every frequencypartition in which the base is transmitting to the RU. This requirementconflicts with the desire to reduce RU costs since the necessity oftransmitting WTMs over all the partitions would greatly increase thecost of the power amplifiers in each RU. Time multiplexing the RUtransmission opportunities over all the desired partitions can reducetransmit power requirements. For example, during one frame a WTM messagecan be sent over one partition and during the next frame a WTM messagecan be sent over a different partition.

FIG. 18 illustrates an example of time and frequency use resulting froma RU bandwidth expansion method 201. In this example, the RU doubles itsavailable bandwidth from one subband to two subbands, 202 and 204, in aforward link 208 and a reverse link 206. Each subband 202 and 204 isdivided into partitions 203. In this configuration there are fourtransmission slots 205 a through 205 d on the reverse link 206 followedby four available receptions slots 207 a through 207 d on the forwardlink 208 for each RU 218 a 1–218 a 9. A RU's use of a particular slot isindicated by a numeral 209 in that slot. The first RU 218 a 1 is denotedby a “1” and the third RU 218 a 3 is denoted by a “3.”

During the first two slots 205 a–b, the first RU transmits over the full1 MHz bandwidth of the first subband 202. The first RU uses thesetransmission opportunities to transmit WTM's to support a high bandwidthdata transfer to the first RU in the first subband 202. During the thirdand fourth slots 205 c–d, the first RU transmits over the tones in thesecond subband 204. This transmission of WTM's is used to train weightsfor forward link transmission 208 in the second subband 204.

The third RU, on the other hand, does not require the full forward linkbandwidth and instead confines its reverse link transmission 208 to asingle subband 202. The third RU's transmission mode supports themaximum reverse link symbol rate. This requires that the base 216 arestrict its forward link transmission 208 to the first subband 202. Inthis example, neither RU 218 a 1 or 218 a 3 at any time transmits over abandwidth greater than 1 MHz. This allows the RU designer to avoid thecost of doubling the RU transmit power which may typically quadruple thecost of the RU power amplifiers.

Frequency Plan

In an example of preferred embodiment, the available spectrum is dividedinto operational units called subbands. A remote unit is generallyprovisioned to use one subband pair, though additional throughput can beachieved by using additional subbands. FIG. 21 illustrates a group oftone partitions within a subband 310. For this example, based on RF andFFT processing considerations, a subband bandwidth of 1.25 MHz isdivided into 25 partitions. Each partition 312 has 16 tones with tonespacing of 3.125 KHz, so the partition spans 50 KHz. Each tonecorresponds to a frequency bin. This arrangement has a total of 400tones.

FIG. 22 illustrates a frequency plan 320 with a spectral spreadingfactor, or frequency spreading factor, of two. The available bandwidthis divided into a number of subbands 322 a and 322 b and guard bands324. Each 1.25 MHz subband has 25 partitions 326. Each tone 328 in apartition has a complex gain. The example in FIG. 22 illustrates complexgains mapped to a 16 QAM constellation. The data within each partitionof subband 322 a are repeated in its paired subband 322 b. Althougharbitrary spreading factors can be supported, the factor of two iseasily applied to paired frequency bands such as the PCS and WCS bands,described below regarding FIGS. 54 and 55.

Partitions “0” through “24” are used for “normal” traffic. Although the25^(th) partition 325 may also be used for traffic, it may be reservedfor base directed communications, such as requesting status or healthfrom particular RUs. For base directed communications, RUs may not usethe partition unless directed to do so by a base. In the future,out-of-band control information associated with T1 links may be carriedover this partition. The 25^(th) may also be used as an access channelas described later.

FIG. 23 shows an alternate frequency plan 330 having a spectralspreading factor of four applied to a paired subband frequency plan. Inthis layout, the data within the first 12 partitions 334 a is repeatedwithin a subband 332 a in partitions 334 b as well as in its pairedsubband 332 b. The pairing of partitions within a subband is designed toprovide the maximum frequency separation. The 25th partition 335supports a spreading factor of two.

FIG. 54 gives parameters for applications in particular bands of thespectrum. This table indicates the number of subbands that can besupported within the indicated bandwidth for the listed frequency bands.The remaining bandwidth is assigned as guard bands. Referring to FIG.54, it is possible to pair the Wireless Communication Service, or WCS, C& D blocks to form a 2×5 MHz bandwidth layout, but the stringentout-of-band emissions for these bands require larger guard bands thanthe A & B blocks. The Multichannel Multipoint Distribution Service, orMMDS, band includes many 6 MHz channels. The assumption here is that two6 MHz channels are combined to form a 12 MHz block. Example calculationsare as follows.400 tones per subband=1.25 MHz per subband/3.125 KHz per tone400 tones=25 sets×16 tones per set384 tones=24 partitions×16 tones per partition50 KHz per partition=16 tones per partition×3.125 KHz per tone

FIG. 55 gives frequency plans for several bands where the presentinvention may be deployed. These frequency plans assume a 1.25 MHzactive subband. The number of subbands, total active bandwidth, andguard band size are listed for various channel bandwidths. Guard bandbandwidth generally increases with frequency.

Time Plan

FIG. 24 illustrates example of a time plan for a single time slot 340.Table 1 gives example durations of the time slot parameters. For thisexample, each TDD time slot 340 is 3⅓ ms in duration. A time slot isdivided into a base transmit opportunity 342 and RU transmit opportunity344. Within each transmit opportunity, signals are transmitted in aseries of bursts, five bursts 346 from the base and four bursts 345 froma RU. Each burst spans T_(g)+T_(b) μs. The parameter T_(g) is for theinter-burst guard time 348 that allows the receiver to collectsignificant multipath. The first column of duration values in Table 1 ispreferred. In this arrangement, every two of three time slots in thereverse link have an additional 0.3 ms in T_(r) and the third time slothas an additional 0.4 ms in T_(r) so that three time slots span 10 ms.

TABLE 1 Time Slot Definitions. Parameter Duration (μs) Duration (μs)Description Tb 320 320 Burst length Tg 20 25 Guard time Tf 243 193Excess time in the forward link Tr 30 35 Excess time in the reverse linkTbase 1943 1918 Base transmit/RU receive Tremote 1390 1415 RUtransmit/Base receive

FIG. 25 gives a model 350 useful for defining time delay parameters. Thebase SAW filter 352 and RU SAW filter 354 implementations cause delay inaddition to delay caused by multipath 356. The value of T_(g) includesadditional delay quantities with typical values given in Table 2. Thebase differential group delay assumes a worst case delay of 3.5 μs minusthe least delay of 3.1 μs. The RU differential group delay assumes aworst case delay of 3.0 μs minus the least delay of 1.8 μs.

TABLE 2 Guard Time Duration. Parameter Duration (μs) Base Tx Window 0Base SAW 0.4 Multipath 18.4 RU SAW 1.2 RU Rx Window 0 Tg 20.0

The excess time parameter T_(f) following the last burst from the basestation defines the transmission range, and is designed to mitigatebase-to-base interference. The T_(f) constrains the cell radius. Theexcess time following the last burst from a RU is T_(r) μs. The T_(r)cannot be reduced below the transmit/receive switch settling time, whichis on the order of 30 μs. Every three time slots span 10 ms (3⅓ ms×3slots). The sampling rate at the remote unit is 25.6 MS/s (megasamplesper second), so there are 25,600 samples every three time slots. Hence,two time slots span 8,533 samples and the third time slot spans 8,534samples.

Time/Frequency Plan

Examples of time/frequency plans are represented by partition layouts.FIG. 26 illustrates a partition layout 360 over twelve time slots 362and 25 partitions 364. A set of time slots in a partition is referred toas a frame 366. For example, in FIG. 26, there are 6 time slots 362 perframe 366. The first time slot within each frame is designated as theentry slot 368, and is used for link establishment and synchronizationsignals. It is preferable to stagger the entry slots in time acrosspartitions so that there is at least one partition with an entryopportunity in any given time slot. FIG. 26 shows a partition layoutwith at least four entry opportunities in each time slot when using sixslots per frame, referred to as a 4×6 layout.

FIG. 27 shows a partition layout 370 with three time slots 372 per frame374. The entry slots 376 provide at least eight entry opportunities ineach time slot, for an 8×3 layout. The arrangements of FIG. 26 or FIG.27 can be used with a spectral spreading factor of two as illustrated inFIG. 22.

For a spectral spreading factor of four, either additional bandwidth isused or the data are spread within a subband. As previously describedand illustrated in FIG. 23, for spreading within a subband, partitionsk=01 . . . 11, are paired with partitions k=12 13 . . . 23. The 25thpartition is spread across only two spreading frequencies. FIG. 28illustrates a partition layout 380 for a spectral spreading factor offour. The layout 380 has six time slots 282 in each frame 384. Thelayout 380 has 2 entry slots 386 per time slot, for a 2×6 layout.

FIG. 29 illustrates an alternative layout 390 for a spectral spreadingfactor of four. The layout 390 has six time slots 392 per frame 394 andfour entry slots 396 per time slot, for a 4×6 layout.

FIG. 56 gives some example throughputs for a 4×6 layout and a 3⅓ ms timeslot duration. The full rate corresponds to 24 partitions using the bitrate per partition, or partition rate. The number of information bitsper tone depends on the constellation used for mapping bits to thecomplex gain for each tone. The number of bursts is five for the forwardlink and four for the reverse link.

The frame length can be selected to accommodate different applications.For example, the frame length can be selected to accommodate Ethernetframes. Ethernet frames on an Ethernet LAN are typically 1518 bytes orless, while Ethernet frames on the Internet are typically 594 bytes orless. Frames with a larger number of time slots can accommodate 594bytes of data and any additional overhead. For voice applications,speech frames are typically 10, 20 or 30 ms long. A 3⅓ ms time slotmatches the 10 ms speech frame every three time slots, and 20 ms speechframes every six time slots. The number of bytes per speech framedepends on the codec used.

Physical Layer Channels Reverse Link RLI and RLB

Physical layer channels for the reverse link include a reverse linkinitiation (RLI) channel and a reverse link bearer (RLB) channel. TheRLI channel allows a RU to request access for a given frame on a givenpartition. The RLI channel occurs within an entry slot and spans allbursts of a time slot. The RLB channel is used for data, bothinformational and supervisory. RLB channels occur on all non-entry timeslots and also span all bursts of a time slot.

Forward Link FLI, FLT, FLS, FLB

Physical layer channels for the forward link include forward linkinitiation (FLI), forward link training (FLT), forward linksynchronization (FLS) and forward link bearer (FLB) channels. The FLIchannel allows a base to command a RU to enter on a specific framewithin a specific partition. The FLI channel occurs within an entryslot. The FLT channel, which also occurs within an entry slot, allows aweight training message to be transmitted so that a RU can update itsdespreading and spreading weights. The FLS channel, which also occurswithin an entry slot, provides a synchronization message used by a RU tomaintain time, frequency, and phase synchronization with a base. FIG. 30illustrates FLS, FLI, and FLT assignments to bursts within an entryslot. FLS channels occupy the first and fourth bursts. FLI channelsoccupy the second and third bursts. The FLT channel occupies the fifthburst. The forward link bearer (FLB) channel is used for data, bothinformational and supervisory. FLB channels occur during non-entry timeslots of a frame and span all bursts.

Access Channel FLA and RLA

In an exemplary embodiment, the first 24 partitions are used as trafficchannels and the 25^(th) partition is used as an access channel. A RUcan access the network by sending a reverse link access (RLA) message onthe reverse link access channel. These access requests are isolated fromthe traffic channels. The base can initiate communication with a RU bysending a forward link access (FLA) message on the forward link accesschannel. The access channel method is an alternative to the alertchannel method described previously.

Time/Bandwidth Allocation

A base manages system resources to achieve quality of service (QoS) andload balancing requirements among all users in a cell. RUs use aslotted-Aloha mechanism to communicate with a base for sending bothsupervisory messages, such as bandwidth requests, and information datamessages. Each base can resolve up to M_(base) simultaneous users, whereM_(base) is a function of the number of degrees of freedom at a base andthe network topology, such as number of in-cell and out-of-cellco-channel interferers, and severity of the multipath. For a fullycellularized network in a suburban environment, M_(base) is nominally 10for a base with 16 sensors and using two subbands. Nominal values forother base configurations are summarized in Table 3. In practice,M_(base) is a soft number in the sense that the number of simultaneoususers that can be supported will depend on the instantaneous user andnetwork topology and multipath environment. Hence, M_(base) will deviateabout a nominal value as a function of the signal to interference plusnoise ratio, or SINR, for a frame within a partition. The number ofsimultaneous links that can be maintained in the presence of in-cell andout-of-cell interference is approximately ⅓ the degrees to spatial andspectral degrees of freedom. The values in Table 3 are based on a ngfactor of 2.

TABLE 3 Number of Simultaneous Links. Number of Degrees of ElementsFreedom M_(base) Comments 4 8 2 6 12 3 8 16 4 9 18 5 12 24 6 15 30 8 1632 9 RU antenna: 30 ., 3 dB beamwidth 16 32 10 RU antenna: 20 ., 3 dBbeamwidth 16 32 16 Single cell deployment

To minimize the impact of unscheduled traffic and provide management ofthe reverse link contention oriented channels, each RU is assigned to ahome partition. A RU can use the home partition for initial contact witha base. Using a communication channel on the home partition, the RU canrequest additional bandwidth from the base. A RU is assigned a set ofhome partitions, such as one partition per time slot. The assignment candepend on service level agreements and the number of RLI codes that canbe supported by the physical layer. When more than M_(base) userscontend for a frame on a partition, collisions may occur. Whencollisions occur, users apply a back-off mechanism to retrycommunicating with a base.

The base can allocate resources based on the requirements of a service.Services such as data are bursty, in which case frames will be allocatedas needed and available, then released. A preferred approach for theseservices is to rapidly apply system resources such that the datatransfer occurs in a minimal amount of time. For large data transfers,this requires rapidly allocating the use of all partitions, andsubsequently releasing the resources so that they are available forother users. In cases involving smaller datagrams, such as, TCPacknowledgements, only a subset of the partitions would be allocated.The time scale for reservation of resources is estimated to be on theorder of milliseconds or tens of milliseconds, whereas thenetwork/server delays may be on the order of hundreds of milliseconds.During non-peak hours, it may be possible to minimize the latencyassociated with allocating resources by sending idle bits during periodsof inactivity for maintaining links. During peak hours, resources for agiven user would be allocated and released on a burst basis to supportthe necessary level of multiplexing between users.

Services such as voice and streaming audio/video tend to be more regularin terms of their bandwidth requirements. This means that resourceswould be allocated or reserved for extended periods of time. This isparticularly true for highly quality voice where latency is a keyconcern and allocating resources on a packet by packet basis is notpractical given current physical and logical link layer processingtimes. An initial latency associated with setting up a channel isinsignificant. Since this occurs during the signaling phase, it does nothave the stringent latency requirements associated with thevoice/audio/video payload.

Airlink Frames

For transmission over the airlink, Ethernet frames encapsulating IP(Internet Protocol) datagrams are passed to the data link layer. Withinthe data link layer, a datagram is segmented into airlink frames.Airlink frames are atomic units with fixed duration and provisioned in anetwork to be either 20 or 10 ms. The airlink is packet switched sincethe airlink frames are dynamically assigned to users based on loadingand QoS parameters. The airlink frames are assigned on frame epochs. Forthe reverse link, a low-rate contention channel is used to mediateaccess to multiple bearer channels. For the forward link, the basestation uses the low-rate channels to schedule bearer channels.

FIG. 31 illustrates a channel structure for an airlink frame. Eachairlink frame begins with an initiation message from a RU on the reverselink initiation (RLI) channel, and a training message from the baseresponds on a forward link training (FLT) channel. The remainder of theframe includes data on bearer channels. Because a base station cannotcompute spreading weights instantaneously, the entry slots for thereverse and forward links are offset. For an example shown in FIG. 32,the forward link entry slot is offset from the reverse link entry slotby two time slots. For this example, the base station and RU eachcompute and apply spreading weights within one time slot. The forwardand reverse link frames are offset to allow time for computation ofspreading weights.

RU Initiated Transfer

If a communication link between a RU and a base is not currentlyestablished, a reverse link initiation message is sent to a base. FIG.33 illustrates a reverse link initiated transfer. The entry slot ofevery frame has a RLI and FLT. The base station forms transmit weightsin response to the RLI. The FLT provides a positive acknowledgement. Theforward and reverse link frames are offset because of the processingtime required to compute transmit weights. In the example of FIG. 33,the (1,1) RLB is transmitted even though the positive acknowledgementhas not yet been received. This reduces latency with little impact onnetwork performance. If the RLI is received successfully, then the RLBcan also be received successfully. If the base station as interferenceconsiders the RLI, the base will have formed weights to reject thesubsequent (1,1) RLB from this same remote, and can continue tosuccessfully receive other signals.

The RLI message is transmitted on a frame in a RU's home partition. EachRU is assigned a RLI code that is unique to that RU for the frames andpartitions for which it is assigned. That is, multiple RUs may share aRLI codeword, but no more than one RU will use that codeword in a givenframe within a given partition. When prior spectral spreading weightsare not available or are out-of-date, random spreading weights, scaledto a desired transmit power, can be chosen for the RLI channel.

After detecting a RLI, a base will respond with a FLT in the nextforward link entry slot in the same partition as that of the receivedRLI. The FLT is and acknowledgement that the RLI was successfullydetected and provides a training signal that the RU may use to determinedespreading weights. Because of the offset of entry slots, the remoteunit will not receive a message back from the base station in the nexttime slot. Rather than wait, the remote unit will use the priorspreading weights and send a RLB message containing data. In the absenceof a collision and assuming the base permits the connection, the basestation will send a weight training message in the FLT on the samepartition. The remote unit will interpret this FLT as a positiveacknowledgement of a link establishment and continue to send RLBmessages. If the base station has no data to send to the remote unit,the base station will transmit idle signals for weight trainingpurposes. Similarly, the RU will pad its frame with idle signals so thatthe base station can send it data any time during the frame.

If the remote does not detect the FLT, it assumes that a collision hasoccurred and repeats the RLI process on a subsequent time slot. Twotypes of collisions may occur. First, the base station is able toresolve up to M_(base) simultaneous RLI signals. If more than M_(base)remote units transmit RLI signals on the same time slot within the samepartition, some or all of the signals will not be detected. Second, itmay be possible that multiple remote units will be provisioned with thesame RLI codeword. In this case, remote units using the same codewordwill collide and their signals will not be detected.

Forward Link Initiated Transfer

FIG. 34 illustrates forward link initiated transfer. Forward linkinitiated transfer is nearly identical to reverse link initiatedtransfer. The difference is that a base station commands a RU to a senda RLI so that the bearer channel weights can be determined. It does thisby sending a FLI message as shown in FIG. 34. The FLI transmitted on theinitial frame of a datagram to command a RU to send a RLI for weighttraining purposes. Thereafter, the command for a RLI on additionalpartitions can be sent as part of the data link layer's overhead.

Although a remote unit can detect a FLI message quickly, the next entryopportunity on that partition for a RLI message does not occurimmediately. If this latency is not acceptable, the RLI message inresponse to the FLI message can be sent on another partition. Forexample, latency is about 13 ms for a layout with 6 slots per frame.When the FLI message is sent on another partition, the minimum latencyis 3 ms, assuming that the remote unit detects and responds to a FLImessage in the next time slot.

Airlink Protocol

The reverse link initiation (RLI) channel occurs on a reverse link entryslot. This channel allows a remote unit to send a defined signal to thebase station. The RLI includes a training signal used to computeadaptive despreading weights and initial spreading weights for the nextbearer message. The RLI channel is a slotted Aloha contention orientedchannel, but a base station can demodulate multiple RLI signals usingbeamforming and the structure of the codes. RUs contending for a RLIchannel are managed users, where managed users have been directed by abase station to use specific airlink resources. The base manages thenumber of users contending for a RLI channel using the access channeland RLA procedure, described later.

Each base station has a set of RLI codewords. Each remote unit uses aRLI codeword, or preamble, from the set of codewords specific to thecorresponding base station. In a preferred embodiment, the number of RLIcodewords is sufficient to define a unique codeword per RU in a cell. Inan alternative embodiment, multiple RUs may share a codeword, but onlyone RU may use the codeword in a particular partition and a particularframe. A remote unit may be provisioned to use codewords from a setdesignated for initial entry. Once a link is established, the basestation may direct a remote unit to use a codeword from an alternate setto minimize detection errors with other new entrants. For an exemplaryembodiment, the defined training signal is a codeword, or preamble, witha length of 64 symbols, corresponding to the 64 symbols in a reverselink entry slot.

The base coordinates between remote units transmitting on the RLIchannel. After transmitting a RLI message, the remote unit will listenfor a FLT message from the base station on the same partition. If a FLTmessage is received, the remote unit will use the RLB message on theremaining slots in the frame to transmit data. If the FLT message is notreceived, the remote unit may wait for the next entry slot on thatpartition or transmit a RLI message on an entry slot in anotherpartition.

It is possible to designate a partition for restricted access, meaningthat remote units are not permitted to contend for the channel unlessdirected to do so by a base station. This provides a base station with aprocedure for maintaining a virtual circuit by managing the contentionon that partition.

To provide compensation measurements at the base station, certain entryslots are not RLI opportunities. These “blanked out” RLI opportunitiesshall be scheduled according to some published formula based on thepartition number and the global slot counter. Both the base and theremote unit behave as if the same remote units sending traffic duringthe previous frame are continuing in the present frame. In the currentframe, weights are carried forward from the previous frame, a FLT issent, and that valid bearer traffic will be sent in both directions.This allows the blanking of RLI opportunities to be conducted withoutdisrupting steady flows of bearer traffic.

The reverse link bearer (RLB) channel occurs on non-entry slots within aframe. This channel is used to transmit data, link layer messages,bandwidth requests and, in the absence of any data, idle (training)signals to maintain the frame connection from a remote unit to its basestation.

For reliable reception at a remote unit, the base applies spatial gainto the channels of the forward link entry slot. For this purpose, thebase stores weights determined during installation of a remote unit orupdated during prior transactions.

The Forward Link Initiation (FLI) channel occurs on a forward link entryslot. This channel allows a base station to inform a specific remoteunit to send a RLI message on a particular partition and time slot sothat forward and reverse link bearer channels can be setup. A FLImessage is a codeword used to uniquely identify a remote unit. For anexemplary embodiment with 16 tones per partition, each codeword is acomplex vector of length 16 corresponding to the complex gains appliedto the 16 tones. Associated with each FLI, and hence each RU, is anaperture weight vector. These weights form a beam in the direction of aRU but do not steer nulls. Only one FLI codeword is assigned to a RU.

For the examplary layouts of FIGS. 26 and 30, there are four entry slotsper time slot, ignoring the 25th partition, and the two FLI bursts perentry slot. For this arrangement, the base can send FLIs to up to 8 RUsper time slot. Each RU processes a single burst within a partition insearch of a FLI message. Once bearer channels are created on apartition, control information sent within the bearer channels canconvey requests and allocation messages for additional bandwidth. Withthis arrangement, additional FLIs are not needed to inform a RU to senda RLI message on additional partitions.

The base may request a user that has a large data transfer pending tominimize entry time by entering in all available entry slots. In thissituation, a RU must monitor every FLI message opportunity. For a 4×6layout, such as in FIG. 26, this requires the RU to monitor fourseparate partitions within a single time slot. Since the monitoringcomputations occur while the RU is in the inactive state, the peakoperating performance, in terms of floating point operations per second,is not affected.

The Forward Link Training (FLT) channel occurs in a forward-linkentry-slot. This channel allows a base station to send a known trainingsignal to a RU. The RU uses the FLT message to update itsdespreading/spreading weights for the next RLB channel.

The Forward Link Synchronization (FLS) channel occurs on a forward linkentry slot. This channel allows a base to send a known signal to aremote so that the remote can update its time, frequency, and phasetracking parameters to maintain synchronization with the base.

The forward link bearer (FLB) channel occurs on non-entry slots within aframe. This channel is used to transmit data from a base unit to aremote unit. The forward link bearer channel uses the same forward errorcontrol coding used by the RLB.

The reverse link access (RLA) message is sent by the RU on the 25^(th)partition and requests the base to open a flow with the RU. The reverselink access channel is contention oriented. If too many RUs send in arequest at the same time, some may not be detected and will need toretransmit RLA messages. The RLA detection method and codewords aresimilar those of the RLI. The RLA can occur during any time slot.

The forward link access (FLA) channel occurs on any burst within a slot.It is sent on the 25^(th) partition, or access channel. This channel isused similarly to the FLI. The burst position of the FLA indicates thepartition that the RU should use to send a RLI.

A flow is a set of adjacent frames exchanged between the base and the RUon a particular partition. A flow may be started by the base in one ofthree ways: as part of a control message from the base to a RU in anexisting flow on another partition, by sending a FLI on the partition inwhich the flow is to occur or by sending a FLA on the access channel.The number of frames in a flow is negotiated during flow initiation. ARU cannot initiate a flow by sending a RLI, but rather is directed to doso by the base. A RU can request a flow by sending a RLA.

A flow is in one of five states: closed, waiting, starting, open, andending. If neither the base nor the RU have any traffic to send orreceive on a particular non-voice flow, then that flow is closed toconserve link bandwidth.

A session is one or more simultaneous flows each on separate partitionsbetween the base and a particular RU. Sessions eventually terminate toprevent an excessive number of RUs from sending or receiving only dummy,or filler, data.

If the base decides that the communication rate should increase with aparticular RU, the base increases the number of flows with that RU. Thenumber of flows is also governed by the service agreement.

A remote unit is in the ACTIVE_ON state if there is a session or a flowon any partition. A remote unit is in the ACTIVE_OFF state if it used tobe in the ACTIVE_ON state and less than ACTIVE_OFF_TIMEOUT slots haveelapsed since the last RLI was sent on any partition. A remote unit isin the INACTIVE state when there is not a session and ACTIVE_OFF_TIMEOUTslots or more have elapsed since the last RLI was sent on any partition.An ACTIVE_OFF state means that no traffic has occurred in the lastACTIVE_ON_TIMEOUT slots on any partition.

If a RU receives any FLI or FLA, it transitions to the ACTIVE_ON state.The RU remains in the ACTIVE_ON state while either it or the base sendsbearer data on any partition of the traffic channel.

If neither the forward link nor reverse link carry bearer data forACTIVE_ON_TIMEOUT slots on any partition, then the base and RU exchangemessages and acknowledgements and transition to the ACTIVE_OFF state.

A time slot counter is recorded when the RU transitions to theACTIVE_OFF state. A RU in the ACTIVE_OFF state transitions to theINACTIVE state after being in the ACTIVE_OFF state forACTIVE_OFF_TIMEOUT slots. Thus after a certain amount of time expires,the RU is moved to the INACTIVE state.

There are two logical channels: traffic and access. In an exemplaryembodiment, there are 25 partitions. The first 24 partitions constitutethe traffic channel. The last partition is the access channel. Theaccess channel does not use frames.

In a preferred embodiment, a network operates with its traffic channelin one of two spreading factor modes. Referring to FIGS. 22 and 26 for aspreading factor of 2, the frequency plan has a total of 24 partitionswith both an upper and lower carrier. The layout includes 4 partitionswith an entry slot per time slot and 6 entry slots per 6-slot frame.Referring to FIGS. 23 and 29 for a spreading factor of 4, the frequencyplan has a total of 12 partitions, with 2 groups of 12 partitions on thelower carrier and another 2 groups of 12 partitions on the uppercarrier. The layout includes 4 partitions with an entry slot per timeslot and 3 entry slots per 6-slot frame. For each mode, the accesschannel has a spreading factor of 2.

The base transmits during the first half of a time slot and the RUstransmit during the second half of a time slot. On the traffic channel,FLI, FLT, FLS, and FLB messages are sent on the forward link, and RLIand RLB messages are sent on the reverse link. On the access channel,FLA messages are sent on the forward link, and RLA messages are sent onthe reverse link.

There are 12 base offset codes. The assignments of base offset codesdistinguish one base from its adjacent neighbors. FIG. 49 and FIG. 51illustrate geographical layouts of bases with their associated baseoffset codes. The base offset codes range from 0 to 11.

Each provisioned RU in a subband of a base is assigned a unique accesscode. The access code is reused from subband to subband and from base tobase. A database in maintained to correlate the access code with the RUidentification number. In a given subband in a given base, each RU hasits own unique access code. The access code specifies which RLA messageis used by the base to communicate with the RU. Similarly, access codesalso specify RLI, FLA, FLI, and FLT messages.

For an exemplary embodiment, there is a maximum of 4032 access codes.The access codes, a=2016t+c, are divided into two equal sets. The firstset of access codes, (t=0, 0≦c≦2015) is for bases with an even baseoffset code. The second set of access codes, (t=1, 0≦c≦2015) is forbases with an odd base offset code. Each set of 2016 access codes aredivided into three groups with each group allocated a certain number ofaccess codes. There are 2000 access codes, a, for provisioned RUs:0≦c≦1999; there are 8 access codes, a, for ranging RUs: 2000≦c≦2007; andthere are 8 access codes, a, for installation RUs: 2008≦c≦2015.

The access codes are reused every other cell. The rectangulararrangement of cells shown in FIG. 51 is preferred to the hexagonallayout shown in FIG. 49. The following methods enable code reuse:

-   1) code selectivity: assignment of a set of access codes to even    cells and the remaining access codes to odd cells;-   2) spatial selectivity: directivity of antenna patterns that focus    the transmitted power in the direction of the intended receiver    within the cell rather than to receivers in adjacent cells;-   3) power discrimination: RUs within the cell transmit at just enough    power for their base but not enough for the adjacent bases;-   4) delay separation: codewords received from an adjacent cell have    more delay than those within the cell and consequently have their    symbols modulated by a phase ramp; and-   5) time schedule: only certain subsets of RUs are permitted to send    RLAs at specific times.

If the RU is not yet provisioned and does not know its range, itrandomly chooses a ranging access code, sends a RLA message, attempts todetect a FLA response from the base, and adjusts its delay and transmitpower based on whether a FLA was detected. It repeats this process untilthe best delay and transmit power have been identified. The RU uses anaverage power level of received FLS signals to select its initialtransmit power level.

If the RU is not yet provisioned and knows its range, it randomlychooses an installation access code, sends a RLA message to the base,receives the FLA response from the base, and sends a RLI on thepartition indicated by the FLA. It continues communicating with the baseto finish the provisioning process. If the base has an open session withan installation RU, it ignores subsequent RLAs with the same access codefrom other RUs. If an installation RU fails to receive a FLA on theaccess channel, it waits a predetermined amount of time before choosinganother installation access code and repeating the process.

The base decides when to end a flow by evaluating the number of flowsand the number of packets in the forward and reverse link queues. Ittakes three frames to end a flow. In each frame, the base sends two bitsof information indicating the frame number of the “ending” state. Thiscounter begins at 1 in the first frame of the “ending” state andconcludes at 3 in the third frame of the “ending” state. The base doesnot transmit the frame after the third frame of the “ending” statebecause the flow will be closed. A counter value of 0 is reserved toindicate that the flow is not in the “ending” state. The RU receives thecounter in any of the FLB messages. If the counter is non-zero, the RUdetermines that the flow is ending and decides how many additional RLIsto send the base. The RU must detect a counter value of 1 or 2 in orderto turn off the flow at the same frame number as the base. When both ofthese FLBs have an excessive BER, the RU encryption engines will be outof sync with those of the base. An alternative approach is that the basesends the time slot counter value of the first slot of the closed statein each FLB message of the “ending” state. The RU would compare thecurrent time slot counter with the value in the medium access control(MAC) message to determine when to close the flow.

Time Slot Counter

In an exemplary embodiment, the time slots are numbered from 0 to2147483399 inclusive. There is one logical time slot counter in the baseand one time slot counter in each RU. If there are multiple time slotcounters in the base, they all contain the same value and increment atthe same time. The time slot counter is at least 31 bits wide, indicatesthe number of time slots that have gone by, and wraps around every2147483400 slots. At 300 slots per second, the wrap around occurs every7158278 seconds (82.9 days). Every second, on the second, the reverseentry slot of the first partition begins.

Twenty-four frame counters, one for each partition, can be derived fromthe time slot counter. The frame counter, n(j;k), is calculated by thefollowing formula,n(j,k)=[(j−d*k+s)÷6] & 0×7FFFFFFF,where the division and the bit-wise “and” function use 32-bit 2'scomplement arithmetic, j is the time slot counter, k is the zero basedpartition number, d is 1 for two way spreading and is 2 for four wayspreading, and s is 0 for the reverse link and is 3 for the forwardlink.

The entry slots occur when the following is true,mod[(j−d*k+s),6]==0,where j is the time slot counter, k is the zero based partition number,d is 1 for two way spreading and is 2 for four way spreading, and s is 0for the reverse link and is 3 for the forward link. The forward entryslots are different in time from the reverse entry slots. The forwardentry slot transmission begins approximately 2.5 slots after the reverseentry slot transmission begins. There are no reverse entry slots on oddslots for four way spreading, as shown in FIG. 62.

The base and the RU have time slot counters that contain the same countand virtually increment at the same time. All of the time slot countersin a network contain the same count and virtually increment at the sametime.

Timing and Weight Dependencies

FIG. 48 is an illustration of timing and weight dependencies duringcommunication of RLIs, RLBs, FLT and FLBs between a RU and a base. Thebase receives a RLI 722 from the RU from slot j+0.5 to j+1. The baseuses the RLI 722 to form its initial base receive weight vector which isused to despread the RLB 724 from the RU received from slot j+1.5 toj+2. Thereafter, the RLB 724 from slot j+1.5 to j+2 is used to updatethe base receive weight vector which is then used to despread the RLB726 from slot j+2.5 to j+3.

The base also uses the RLI 722 from slot j+0.5 to j+1 to form itsinitial base transmit weight vector. The initial base transmit weightvector is first used to spread the FLT 730 transmitted from the basefrom slot j+3 to j+3.5.

The base also uses the RLB 724 from slot j+1.5 to j+2 to update its basetransmit weight vector. The updated base transmit weight vector is firstused to spread the FLB 732 transmitted from the base from slot j+4 toj+4.5.

The RU receives a FLT 730 from the base from slot j+3 to j+3.5. The RUuses this FLT 730 to initialize its RU receive weight vector which isfirst used to despread the FLB 732 from the base received from slot j+4to j+4.5. Thereafter, the FLB 732 from slot j+4 to j+4.5 is used toupdate the RU receive weight vector which is then used to despread theFLB 734 from slot j+5 to j+5.5.

The RU uses the RU receive weight vector as updated by the FLB 734 inslot j+5 to j+5.5 to update the RU transmit weight vector to spread theRLI 728 transmitted from the RU from slot j+6.5 to j+7. The RU transmitweight vector is updated just prior to transmitting the RLI 728.

RLI Use

A RLI is sent from a RU to the base during the reverse entry slot of thereverse link.

The RU sends a RLI in two consecutive frames during the “starting” stateof a flow. The RLI in the second frame of a starting flow is always sentregardless of whether the RU receives a FLT in the first frame. The RUtransitions from the “starting” state to the “open” state and thencontinuously sends RLIs on open flows.

The base looks for RLIs in all flows that are not in the “closed” state.The RLI false alarm rate is low because the base does not look for RLIsin closed flows. Thus, the RU can not use a RLI to request the base tostart a closed flow.

There are three different RLI detection thresholds, one for each RLBdata rate of 2, 3 or 4 bits per symbol. If the base would be receivingRLBs with two bits per symbol, then the base uses a low (sensitive)detection threshold. If the base would be receiving RLBs with four bitsper symbol, then the base uses a high (less sensitive) detectionthreshold. The detection threshold also is a function of the number ofbase antennas. Generally the detection threshold is lower for a 6antenna base than for a 16 antenna base.

When a flow at the base transitions from the “closed” to “starting”state, the base records the time slot counter, j, when the first RLI isexpected. If a RLI is detected by the base during time slot j or j+6 inthe particular partition, then the flow state progresses to “open”,otherwise the flow state reverts back to “closed”. If a flow is notsuccessfully opened, the base may try again to start the flow by sendinga FLI during time slot j+12 or by sending a partition allocation messagein an already open flow. This process is repeated until the flow isopened successfully or the base gives up.

If the base fails to receive CONSECUTIVE_RLI_LOSS_THRESHOLD RLIs in arow in an open flow, then the base unilaterally marks the flow asclosed. The base may restart the flow if necessary.CONSECUTIVE_RLI_LOSS_THRESHOLD RLIs has a default of three

Only RUs in the ACTIVE_ON state may send RLIs on non-closed flows of thetraffic channel.

When a RU receives a FLI on the forward entry slot in frame n ofpartition k, it always sends two RLIs, one in frame n+1 and the other inframe n+2, in the reverse entry slot of partition k. Likewise, when a RUreceives a FLA or a partition allocation message, it always sends atleast two consecutive RLIs. In both cases, from sending the first RLIuntil the RU tests for the second FLT, the flow at the RU is in the“starting” state.

While a flow at the base is in the “starting” state, the base attemptsto detect two RLIs, one in the first frame of the “starting” state, andone in the second frame. If either RLI is detected, the flow at the baseproceeds to the “open” state.

At a schedule tied to the time slot counter, the reverse link entry slotmay be blanked out, and may not be used by any RU for the transmissionof a RLI. These entry slots of the reverse link are reserved for basetransmit/receive compensation. The frame associated with that blankedout entry slot is defined to contain bearer traffic between the base andthe same RUs as did the previous frame on that partition. Weights shallbe preserved at the base and RU across the blanked out entry slot. Inthe scheduled time slot, there are usually 4 and sometimes 5 partitionswith a reverse entry slot that would be blanked. Thus, there would haveto be at least 6 scheduled time slots to cover all 25 partitions. For jrepresenting the zero based time slot counter, k representing the zerobased partition under consideration, and d is 1 for two way spreadingand is 2 for four way spreading, then the reverse entry slot is blankedwhen the following is true,(((j−(k*CP_SCHED_MULT)) & CP_SCHED_MASK)<6) && (((j−(k*d))% 6)==0).Candidate values for these system wide variables are CP_SCHED_MULT=157and CP_SCHED_MASK=4095. For the 25^(th) partition, provisioned RUs thathave acquired the correct value of the time slot counter shall nottransmit RLAs during the blanked out slot. RUs without a synchronizedtime slot counter may transmit a ranging RLA or installation RLA duringany time slot.

RLI Weights

The base uses the RLI to calculate the initial value of the base receivedespreading weight vector used during the frame. The weight vector hasan antenna gain pattern with a main lobe in the direction of the RU andnulls in the direction of co-channel interfering RUs.

If the duration of a closed flow is less than RU_WEIGHT_STALENESS slots,then the RU uses the previous transmit weights for this starting flow;otherwise, the RU uses transmit weights with random phases.

When a RLI is not detected, the base uses the base transmit and receiveweights from the previous frame of the current non-closed flow. However,during the “starting” state of a flow, if a RLI is not detected in thefirst frame, then the base transmit weight vector is set to all zeros.Likewise, during the “starting” state of a flow, if a RLI is notdetected in neither the first nor the second frame, then the basetransmit weight vector for the second frame is set to all zeros. Theall-zero transmit weight vector in the “starting” state zeroes the FLTtransmit power which in turn is used to tell the RU (via lack ofdetecting the FLT) that the base did not detect the corresponding RLI.

The same RU transmit weight vector is used to spread both the RLI andthe all of the subsequent RLBs. Since the symbols used to transmit theRLBs have less power than the RLI symbols, the SNR of the received RLBsat the base will be less than the SNR of the received RLI at the base.This SNR decrease, (the ratio of the typical RLB power to the RLI power)is given in the sixth column in Table 4.

TABLE 4 Constellation Power. RMS, Peak/RMS, RMS rel to RMS rel toConstellation Use Index, i B(i) Peak dB RLI, dB FLI, dB 2 BPSK FLS 021.21 21.21 0.0 0.0 7.2 4 QAM RLI, RLA 1 21.21 21.21 0.0 0.0 7.2 8 PSKFLB, RLB 2 14.07 14.14 0.0 −3.6 3.7 16 QAM FLB, RLB 3 15.81 21.21 2.6−2.6 4.7 32 CROSS FLB, RLB 4 13.42 17.49 2.3 −4.0 3.2 FLI, FLT, FLA 59.24 21.21 7.2 −7.2 0.0

RLI Addressing

RLIs uniquely identify which RU, out of all the RUs that are assigned tothe base, is requesting a frame in a partition. RLIs do not uniquelyidentify which base is assigned to the RU. The RLI codes repeat everyother base.

RLIs can be simultaneously received from multiple RUs at the same time.The base uses beamforming and RLI codes to separate the various RUs.

The number of RUs, which simultaneously transmit RLI messages, is lessthan or equal to M_(BASE). The base checks M_(BASE) RLIs per reverseentry slot because the base schedules the traffic on the traffic channelin a deterministic fashion. Since the RUs are scheduled by the base touse particular partitions, the RUs in the ACTIVE_ON state are known andare the only ones permitted to communicate on the traffic channel.

RLI Codewords

An exemplary embodiment uses RLI codewords based on Hadamard basisfunctions. For this example, there is a maximum of 4032 RLI codewords.RLIs are described by an access code, a, 0≦a≦4032. A RLI codeword, p_(i)₁ _(i) ₀ , contains 64 complex symbols and has in-phase and quadraturecomponents taken from the columns of a 64 by 64 Hadamard matrix,p _(i) ₁ _(i) ₀ =15h _(i) ₁ +15jh _(i) ₀ , i ₁ ≠i ₀where h_(i) ₁ and h_(i) ₀ are particular columns from the Hadamardmatrix. The indices i₁ and i₀ select a particular RLI code. For a givenaccess code, a, the zero-based column indices are,i ₁=mod (a,64)i ₀=mod (└a/64┘+i ₁+1,64).For two given column indices, the access code is,a=64 mod (i ₀ −i ₁+63,64)+i ₁.

FIG. 57 gives access codes as a function of the in-phase column index i₁and the quadrature column index i₀. The cross-correlation between anytwo given RLIs based on their access codes is zero if all four columnindices are unique. For this reason, the access codes increment down thediagonals in order to maximize the probability that sequential accesscodes have unique column indices, thereby providing the maximumseparation between one codeword and the next codeword. The maximumcorrelation coefficient between any two codewords is 0.5 and occurs whentwo of the column indices are equal.

Each complex symbol of a RLI codeword has the same amplitude. Thus theratio of the largest amplitude to the RMS amplitude is 0 dB. Themodulation on each complex symbol could be considered QPSK. A scalefactor of 15 is applied to the RLI at the RU prior to it being loadedinto an ASIC so that it contains no more than 5 bits of resolution inthe in-phase and quadrature components. In addition, this scale factormaximizes the transmit power of the RLI since the most positive 5-bittwo's complement number is +15.

FIG. 35 show a flow diagram of dynamic RLI code assignment. A RLI codeis relinquished by and inactive RU and reassigned to a newly active RU.

RLA Use

The RLA can be sent during any slot of the reverse access channel. Whenthe base detects a RLA with a provisioned access code on the reverseaccess channel and if it has unused traffic channel capacity, it sendseither a FLI or a FLA to the RU. If the base detects a RLA with aranging access code, it sends a FLA to the RU. If the base detects a RLAwith an installation access code and it has unused traffic channelcapacity and it does not have an open session with another RU with thesame installation access code, it sends a FLA to the RU.

If a RU sends a RLA and does not receive any FLI or FLA, then itimplements a backoff algorithm thereby waiting a random number ofopportunities before sending the next RLA. The possible reasons for noFLI or FLA are a) the base did not detect the RLA; b) the base did nothave any more traffic channel capacity and so did not send either; c)the base did have unused traffic channel capacity but all of the FLI andFLA bursts were allocated to send messages to other RUs; or d) the RUfailed to detect the FLI or FLA.

The access channel is contention oriented because the number of RLAsthat arrive in a given slot may be more than the maximum number that thebase can detect. Statistically, the majority of the time, the base willdetect all of the RLAs. In the rare case that too many RLAs occur, theundetected ones will be serviced on subsequent RLA transmissions.

Only a certain subset of the RUs in the ACTIVE_OFF state is permitted tocommunicate on the reverse access channel during a particular slot. Thebase has difficulty detecting RLAs if too many arrive at the same time.In addition, to keep the RLA false alarm rate low, the base limits thenumber of RLAs that it looks for. The subset includes all those RUswhose access code, a, is given by,a=g+i,where i is a counter that ranges from 0 to 2^(K) ^(A) −1 for all but thelast subset and ranges from 0 to 2^(K) ^(A) −33 for the last subset. Theparameter g is the first access code of the subset,g=((j+e) & ((1<<K _(A))−1))<<(11−K _(A))+2016*(e & 1),where j is the time slot counter, and e is the base offset code. All butthe last subset have 2^(K) ^(A) RUs in each subset. There are 2^((11−K)^(A) ⁾ subsets. Only 2^(K) ^(A) active-off RUs out of the 2016 RUs cansend a RLA on the access channel on a particular slot. By selectingK_(A), the system can be tuned to control the amount of contention thatis permitted on the access channel. For example, setting K_(A) to 8gives 8 subsets with 256 RUs per subset. For K_(A) set to 8, a RU wouldwait between 0 and 8 slots to send a RLA on the reverse access channel.The delay would range from 0 to 27 ms with a typical delay of 13 ms.

In a similar fashion, only a certain subset of the RUs in the INACTIVEstate is permitted to communicate on the reverse access channel during aparticular slot. The subset includes all those RUs whose access code, a,is given by,a=g+i,where i is a counter that ranges from 0 to 2^(K) ^(I) −1 for all but thelast subset and ranges from 0 to 2^(K) ^(I) −33 for the last subset. Theparameter g is the first access code of the subset,g=((j+e) & ((1<<K _(I))−1))<<(11−K _(I))+2016*(e & 1),j is the time slot counter, and e is the base offset code. All but thelast subset have 2^(K) ^(I) RUs in each subset. There are 2^((11−K) ^(I)⁾ subsets. Only 2^(K) ^(I) inactive RUs out of the 2016 RUs can send aRLA on the access channel in a particular time slot. For example,setting K_(I) to 5 gives 64 subsets with 32 RUs per subset. For K_(I)set to 5 a RU would wait between 0 and 64 slots to send a RLA on thereverse access channel. The delay would range from 0 to 213 ms with atypical delay of 107 ms.

A provisioned RU starts in the INACTIVE state and initiatescommunication with the base by sending a RLA on the access channelduring a prescribed slot that occurs on a periodic basis.

The ACTIVE_OFF_TIMEOUT, ACTIVE_ON_TIMEOUT, K_(A), K_(I), CP_SCHED_MULT,CP_SCHED_MASK, and other similar network wide parameters are sent fromthe base to the RUs in a MAC message.

The base checks only for specific RLA access codes during a given accesschannel slot. The base always checks for the RLAs associated with theinstallation and ranging access codes.

The base uses a detection threshold to determine the presence of a RLA.The detection threshold is based upon the number of bits per symbol usedby the RU for RLB traffic. If the base would be receiving RLBs on thetraffic channel with two bits per symbol, then the base uses a low(sensitive) detection threshold. If the base would be receiving RLBswith four bits per symbol, then the base uses a high (less sensitive)detection threshold. Installation and ranging RLAs use detectionthresholds corresponding to two bits per symbol. The detection thresholdalso is a function of the number of base antennas. Generally thedetection threshold is lower for a 6 antenna base than for a 16 antennabase.

RLA Weights

RLAs can be simultaneously received from multiple RUs at the same time.The base uses beamforming and RLA codes to separate the various RUs.

The RU transmit spreading weights for the RLA have equal amplitude; thepower in the lower carrier is equal to the power in the upper carrier.The phase of the upper carrier transmit weight is selected from apseudo-random number generator that produces at least 16 differentphases and repeats the phase sequence no more often than every 127times. The pseudo-random sequence of phases are unique for each RU.

The transmitted RLA power, measured at the RU antenna, is about the sameas the RLI power. The same technique for selecting RLI power is alsoapplied to selecting the RLA power.

RLA Addressing

RLAs do not uniquely identify which base is assigned to the RU. The RLAcodes repeat every other base.

RLAs uniquely identify which RU, out of all the RUs that are assigned tothe base, is requesting service.

RLA Codewords

The RLA content is identical to the RLI content in terms of number ofsymbols, codeword, and modulation.

FLI Use

The base sends a FLI to a RU to initiate a flow with the RU. A FLI issent from the base to a RU during the forward entry slot. For a 16 tonepartition, a FLI message includes 16 tones during a burst of a forwardentry slot.

Referring to FIG. 30, there are two possible FLI bursts during a forwardentry slot. Thus, the base can send FLIs to two RUs per slot perpartition. For example, in a 4 by 6 layout as in FIGS. 26 and 29, thereare four forward entry slots in 24 partitions. For this example, thebase can send FLIs to a maximum of eight RUs per time slot. If the basehas FLI messages for three or more different RUs in the same forwardentry slot of the same partition, then it must either 1) wait until thenext frame to send one of the messages, or 2) use another flow to sendone of the messages.

The base can also start a flow on a new partition using an open flow bysending information in the MAC header of the open flow. If the RU doesnot receive a partition allocation message, the message is notacknowledged and must be re-transmitted.

If the flow is closed, the base sends a FLI is to the RU start a newflow. The RU responds with a RLI. Then during FLB channels, the basesends parameters that describe the scope of the flow. The RU in turnautomatically transmits RLIs on all frames of the flow while the flow isopen. The base only sends FLIs when a flow is in the “closed” state. Aforward entry slot in frame n may not contain both a FLT and a FLIdirected to the same RU. The FLT is used in frame n and the FLI is usedto request a RLI in frame n+1.

The RU uses a maximum-likelihood based detector to recognize thepresence of its FLI codeword. The RU may falsely detect a FLI and send aRLI on a closed flow. The base would ignore such a RLI since it onlytests RLI access codes corresponding to open flows. The RU would thenrealize that the FLI was a false alarm since it did not receive a FLT onthe first frame of the opening flow. The RU may fail to detect a FLI andthereby not send a RLI. When the base fails to receive a RLI on thefirst frame of the flow that is just opened, it assumes that the RUfailed to receive the FLI and simply sends the FLI at the nextopportunity to open the flow.

The RU uses a detection threshold to determine the presence of a FLI.The detection threshold is based upon the number of bits per symbol usedby the RU for RLB traffic. If the RU would be receiving FLBs with twobits per symbol, then the RU uses a low (sensitive) detection threshold.If the RU would be receiving FLBs with four bits per symbol, then the RUuses a high (less sensitive) detection threshold.

FLI Weights

The base uses a transmit weight vector for the FLI in order to point themain lobe in the direction of the desired RU. The antenna pattern doesnot necessarily have nulls in the direction of other RUs since the FLIis sent to only one RU. Thus, the base uses antenna aperture matchingbeamforming for the FLI transmit weight vector. The transmit weightvector for each FLI burst is tailored for the RU to which it is beingsent. The base uses recent RLB messages in which RLI was successfullydetected to update the FLI transmit weights.

The magnitude squared of the base FLI transmit weight vector is the samefor each RU. Since the FLI power is not shared between multiple RUs, incontrast to FLB power that is shared among RUs, the FLI power is sethigher than the typical FLB. The magnitude squared of the FLI transmitweight vector can be scaled so that it is 4 times (6 dB) larger than themagnitude squared of a typical FLB transmit weight vector. The totaltransmit power depends upon the transmit weight vector power and theconstellation power. As shown in Table 4, the constellation symbols usedto synthesize a FLB are different than those used to synthesize a FLI.Column 4 shows that the RMS power of the FLB relative to that of the FLIdepends upon the constellation type. For each constellation, the RMSpower of the FLB is greater than or equal to that of the FLI. Increasingthe FLI transmit weight vector by 6 dB, makes the relative RMS power ofthe FLI greater than that of the FLB.

FLI Addressing

The content of a FLI identifies which RU should respond to this FLI.Each RU in a cell monitors entry slots for its FLI codeword. AlthoughFLIs are received by all of the RUs in a cell, only the specific RUaddressed detects its FLI codeword and responds to the base.

The content of a FLI does not identify which base is sending the FLI.The RU detects its FLI whether from its base or from a base in anadjacent cell.

For an exemplary embodiment, a FLI burst in a forward entry slot has atmost one FLI message. For this embodiment, FLI messages are not codedivision multiplexed.

FLI Codewords

An example of a preferred embodiment uses FLI codewords based onKronecker basis functions. For this example, there is a maximum of 4096FLI codewords.

FLI messages based on Kronecker basis functions are described by thefollowing.

-   -   Dimension n, 0≦n<4;    -   Access code, a, 0≦a<4096;    -   Generating vector i, with dimension 4 and range 0≦i(n)<8 and        elements,        -   i(0) is bits 0 to 2 of a,        -   i(1) is bits 3 to 5 of a,        -   i(2) is bits 6 to 8 of a, and        -   i(3) is bits 9 to 11 of a:

$a = {\sum\limits_{n = 0}^{3}{{i(n)}{8^{n}.}}}$The elements of generating vector, i, are the four octal digits of a.FIG. 58 shows sample computer code in Matlab® that generates 16 complexspectral values for FLI forward entry bursts given an access code. Forthis example, each FLI codeword has about the same peak to RMS ratio ofthe 16 complex tones, 7.4 dB.

Some FLI codewords are “near” other FLI codewords. About 99.61 percentof the codeword pairs have a correlation coefficient squared less than0.435 and 0.39 percent have a correlation coefficient squared of about0.645. For any given codeword, there are 16 other codewords that are“near” it. If there are two RUs that are near in azimuth and FLIcodeword, then there could be a high false alarm rate at those RUs whendetecting the FLI message. One solution is to separate the RUs inazimuth.

The azimuth that the RU makes with the base is divided into 12 portionseach called an “hour”. For example, a RU that has an azimuth between 0°and 30° with respect to the base, is assigned to hour 0. Ideally, if twocodewords were near each other, then one would be assigned to hour h andthe other to hour h+6, so that they would be far apart in azimuth. Thissix hour separation cannot always be achieved. Instead, the base offsetcode and the “nearness” of the FLI codeword are used to compute thepermissible hours as follows,

${{hour} = {e + {{mod}\left\{ {\left\lfloor {\frac{9}{2}{\sum\limits_{n = 0}^{3}{i(n)}}} \right\rfloor,12} \right\}}}},$where n is the octal digit index, i(n) are the values of the octaldigits, and e is the base offset code, ranges from 0 to 11, andspecifies which base the RU is communicating with. The inverse of theabove equation gives a list of FLI codes that could be assigned to a RU,given a particular base offset code and azimuth in hours.

FIG. 50 illustrates reuse of a particular subset of FLI codewords atdifferent azimuths 744 by different bases 742 arranged in a hexagonallayout. FIG. 52 gives an analogous illustration for a rectangular layoutof bases.

FLA Use

A FLA message can be sent from the base to a RU during any burst of anyslot of the forward access channel. Only one FLA message can be sent perburst to one specific RU.

One or more FLAs are sent from the base only in response to a RLAreceived by the base. In addition, to start a flow on a new partition,the base may send a FLA to the RU without having received a recent RLA.

A FLA may be sent regardless of the RU state, including INACTIVE,ACTIVE_OFF or ACTIVE_ON.

FIG. 53 illustrates the timing relationship 750 of FLAs following a RLA.The RU transmits RLA 752 from time slot j+0.5 to j+1. The base respondsby transmitting a FLA 756 in a burst within the time slot 760 from j+x+4to j+x+4.5, where j is the time slot counter and x is the number ofslots that the base may wait to schedule the FLA, 0≦x<12. The quickestthat the base respond with a FLA is 3 slots, from the end of RLA 752 tostart of FLA 756. This corresponds to transmitting the FLA 756 in burst0 of the time slot 760, with x=0 slots of delay. The base scheduler has12 slots, or 60 bursts, to allocate a partition and select thecorresponding burst and slot for that partition.

The RU responds to a FLA transmitted during a burst within time slot j+4to j+4.5 by transmitting a RLI 754 during time slot j+6.5 to j+7. Thequickest that the RU would respond to a FLA is 2.1 slots, from the endof FLA 758 to start of RLI 754.

If the RU sends a provisioned or installation RLA and the base does notrespond with a FLA or FLI then the RU implements a backoff algorithmbefore sending the next RLA. Likewise, if the RU fails to detect a FLAor FLI within a certain number of slots of the RLA, then it implements abackoff algorithm before sending the next RLA.

The RU uses a detection threshold to determine the presence of a FLA.The detection threshold is based upon the number of bits per symbol usedby the RU for RLB traffic. If the RU would be receiving FLBs with twobits per symbol, then the RU uses a low (sensitive) detection threshold.If the RU would be receiving FLBs with four bits per symbol, then the RUuses a high (less sensitive) detection threshold. Installation andranging FLAs use a detection threshold corresponding to 2 bits per FLBsymbol.

FLA Weights

The base transmitter weights the FLA using a transmit weight vector soas to point the main lobe in the direction of the desired RU. Thetransmit weight vector for each FLA burst is tailored for the RU towhich it is being sent. The transmit weight vector is the antennaaperture derived from the most recently received RLAs on the reverseaccess channel. The transmit weight vector uses aperture matching ratherthan null steering beamforming.

The magnitude squared of the base FLA transmit weight vector is the samefor each RU and is four times larger than the magnitude squared of atypical FLB base transmit weight vector.

FLA Addressing

FLAs with provisioned or installation access codes are used to commandthe RU to send a RLI on a particular partition. The RLI partition can beassigned according to the FLA's burst index and time slot counter. FIGS.64 and 65 give examples of mappings of the FLA's burst index and timeslot counter to RLI partitions for spreading factors of two and four,respectively. The latency of the FLA to RLI is smaller than the latencyof the FLI to RLI.

In each time slot, there are several opportunities for the base to opena flow with a particular RU. With one FLA opportunity per burst, thereare five FLA opportunities per slot. For two way spreading, eight FLIson the traffic channel in addition to the five FLAs on the accesschannel yield thirteen opportunities per slot to start a flow with aparticular RU.

FLAs with ranging access codes are used to indicate to the RU that thecorresponding RLA was detected; the FLA does not command the RU to aparticular partition. A RLA with a ranging access code transmitted fromthe RU from slot j+0.5 to j+1 is sent a FLA during any burst of slot j+3to j+3.5. If all of the bursts of said FLA slot are allocated withprovisioned or installation FLAs, no ranging FLA is transmitted. RangingFLAs have the lowest priority.

The content of a FLA does not identify which base is sending the FLA.The RU detects its FLA whether from its base or from a base in anadjacent cell. The content of the FLA identifies which RU should send aRLI.

FLA Codewords

The FLA has the same number of tones, modulation, and codewords as theFLI.

FLS Use

The base sends FLS messages that the RU uses for synchronization in timeand frequency with the base. The RU also uses the average receivedsignal strength of FLS messages to determine the path loss between thebase and RU. As shown in FIG. 30, each forward entry slot has FLSmessages in the first and fourth bursts, indicated by burst indices 0and 3 in FIG. 61 through FIG. 63.

FIG. 61 gives a table of FLS codeword sequence numbers for a spreadingfactor of two 770. This corresponds to the 4 by 6 layout of FIG. 26. Thediagonal pattern of entry slots in FIG. 26 corresponds to the diagonalpattern of entries in FIG. 61. The pattern of FLS codewords is uniquewithin a superframe 774, or two consecutive synchronization frames 772 aand 772 b, and repeats from superframe to superframe. FIG. 62 gives theFLS codeword sequence numbers for a spreading factor of four. FIGS. 61and 62 show when forward entry slots occur, which partitions haveforward entry slots, and which FLS codeword sequence number is used forthe first burst and for the fourth burst.

FLS Weights

The base selects random transmit weight vectors for FLS messages foreach slot, partition and spreading frequency. Each element of eachtransmit weight vector has the same amplitude and a randomly selectedphase. The random transmit weight vectors are used so that with highprobability, at least one of them has a main lobe in the direction ofeach RU. The random number generator for one partition in one baseshould not be correlated with or have the same repeat period as thegenerator of another partition of any base with a different base offsetcode.

FIG. 63 gives base transmit weight patterns for FLS bursts for aspreading factor of two. Both FLS bursts in a given time slot andpartition use the same transmit weight vector.

The average power in the FLS per degree of freedom (DOF) is proportionalto the average power per DOF of a single user's FLB, to P_(FLI) (afactor used to control the total FLS transmit power) and to M_(BASE)(the maximum number of flows per partition). The FLS power is constantfrom tone to tone and from DOF to DOF. The FLS modulation is constantmodulus and has the same power regardless of the symbol transmitted. Ifthe symbol power changes as a result of using a different modulationscheme, or if M_(BASE) changes, the transmit weight amplitude alsochanges to compensate these variations.

FLS Addressing

Every base uses a particular set of FLS codewords. The base offset codeassociated with the base forms part of the FLS codewords used by thatbase. FIG. 49 gives an example of a hexagonal layout of 24 cells 730.The numeral in each cell 732 is its base offset code. FIG. 51 gives anexample of a rectangular layout of 24 cells. FLS codeword sequences,like the base offset codes, may be reused every 12 cells.

FLS Codewords

Adjacent bases use different FLS codewords so that a RU, which mayreceive FLS messages from both bases, will lock to its assigned base.FIG. 59 gives matrices of FLS codeword descriptors 760 generated using acomputer program in Matlab®. Matrix 762 gives the decimal version andmatrix 764 gives the hexadecimal version. The matrix 764 has 12 rows,each row containing the FLS codeword descriptors corresponding to aparticular base offset code. For each row, there are 12 columns, one foreach slot of a superframe. During the first burst of the first slot of asuperframe, all of the bases would transmit their FLS codewords takenfrom the first column of matrix 764. Likewise, during the first burst ofthe last slot of a superframe, the bases transmit FLS codewords takenfrom the last column of matrix 764. The column index of matrix 764 isthe FLS codeword sequence number and varies from 0 to 11. FIG. 61 andFIG. 62 give the FLS codeword sequence numbers for the FLS bursts in theentry slots for spreading factors of two and four, respectively. Asshown in FIGS. 61 and 62, the superframe sequence pattern repeats every12 slots.

The bits of a FLS codeword descriptor from matrix 764 in FIG. 59 areconverted to BPSK symbols for phase modulating the tones in a FLSpartition. FLS codewords use the extreme points of the constellation,15+15j and −15−15j, in order to maximize their transmit power. Themodulation on each tone could be considered BPSK with the phases being45° or 225°. The peak tone power to average tone power ratio is 0 dB.Other BPSK modulation schemes such as +1 for when the bit is on and −1for when the bit is off are also acceptable at the RU.

A N_(t)=16 tone FLS message is divided into two parts. The lower infrequency N_(b)=12 tones are called the base tones and the upper N_(s)=4tones are called the superframe sequence tones. For a given base, thebase tones are the same for all FLS messages. The base tones correspondto the three least significant hexadecimal digits in any row of matrix764 of FIG. 59 and remain constant for that row. This permits the RU tofirst synchronize to a given base without regard to the superframesequence. For a given base, the superframe sequence tones are differentfor each FLS message. The superframe sequence tones correspond to themost significant hexadecimal digit of the elements of matrix 764. Thisdigit is unique for each element in any given row of matrix 764. Thesuperframe sequence tones permit the RU to recognize the superframesequence number assigned to a particular time slot.

The pattern of FLS codeword sequence numbers for a spreading factor of 2given in FIG. 61 is determined using the following formula.

Let j be the time slot counter in FIG. 61 and n be the column of matrix764 in FIG. 59.

The first burst uses column n₀=mod(j, 12).

The fourth burst uses column n₁=n₀+1−2 mod(j, 2).

A spreading factor of 4 uses a different pattern as shown in FIG. 62.

FIG. 60 gives a computer program in Matlab® that synthesizes a 16 by 1FLS vector for a given base offset code and a given slot number j of asuperframe. A codeword from matrix 764 of FIG. 59 is selectedcorresponding to the base offset code (row index of matrix 764) andsuperframe slot number (column index of matrix 764). The FLS codewordsof FIG. 59 were selected to maximize the probability that the RU wouldlock onto the correct base at the correct superframe sequence and thecorrect frequency.

FLT Use

A FLT is transmitted over the last burst of the forward entry slot, asshown in FIG. 30. The base sends a particular FLT to a particular RU toindicate that the base received a RLI from that RU. When a base receivesa RLI on the entry slot of the reverse link for frame n of partition k,it sends a FLT on the entry slot of the forward link for frame n ofpartition k.

In the “starting” state of a flow, if the RU detects the FLTs in thefirst or second frames, it transitions the flow state to “open”,otherwise, to “closed”. If the RU fails to receiveCONSECUTIVE_FLT_LOSS_THRESHOLD FLTs in a row on an open flow, then theRU unilaterally closes the flow and does not send any RLIs on the closedflow. If there are other open flows with the base, the RU may send a MACmessage to the base on one of the other open flows indicating that itclosed the flow due to lack of FLT detection. The base may reopen theflow via a MAC message on an open flow or by sending a FLI message. Thedefault value for CONSECUTIVE_FLT_LOSS_THRESHOLD is three frames.

A flow must remain closed for at least CONSECUTIVE_FLT LOSS_THRESHOLDframes. The base does not send FLTs for these consecutive frames tosignal to the RU to close a flow that cannot be closed by MAC messagesand acknowledgements. When the flow is subsequently opened, both thebase and RU will start from known flow states.

Since the RU rarely fails to receive its FLT, it continues transmittingthe RLB for that particular frame. The FLT detection thresholds are verylow so that the RU virtually always detects a FLT on open flows. This isbecause the RU expects the FLT on open flows in which the RU just sent aRLI. There are three FLT detection thresholds, one for each data rate of2, 3 or 4 bits per symbol.

FLT Weights

During the forward link entry slot on each partition, the RU tests forthe presence of its FLT. If its FLT is detected, the RU uses thereceived FLT signal to initialize the despreading weight vector forsubsequent FLB despreading. The receive weight vector is used to combinethe upper carrier and the lower carrier and to remove the channel phaseand gain. If a RU fails to receive a FLT, it uses the RU receiverdespreading weights from the previous frame.

For each FLT, the base uses a transmit weight vector to point the mainlobe in the direction of the desired RU. The antenna pattern has nullsin the direction of other RUs that are simultaneously being sent otherFLTs. The FLT transmit weight vector is dependent upon the RLI messages,noise, and co-channel interference.

FLT messages can be code division multiplexed. The base can send FLTmessages to multiple RUs in the same forward entry slot on the samepartition. For example, for two RUs the base adds the FLT spectralvalues for a first RU multiplied by the first RU's transmit weights tothe FLT spectral values for a second RU multiplied by the second RU'stransmit weights. The FLT codes provide separation between differentRUs. Transmit beamforming also provides some isolation. This sameapproach can be applied to sending FLT messages to multiple RUs.

The transmit weight vector for the FLT is different from the transmitweight vector for the FLI or FLS. The RU uses the received FLT and FLB,but not the FLI, to update the RU receive weight vector.

The base transmit weight vector is scaled by a factor of two when usedfor spreading the FLT, but is scaled by a factor of one when spreadingthe FLB. The RU receive weight vector formed using the FLT is scaled bya factor of ½ when used to despread the first FLB. This scalingovercomes the differences in the constellation power of the FLT versusthe constellation power of the FLB, as indicated in Table 4.

FLT Addressing

The content of a FLT identifies which RU should respond to it. FLTs arenot intended to be broadcast to all of the RUs in a cell, but rather toa specific RU. The content of a FLT does not identify which base issending the FLT. The RU detects its FLT whether from its base orpossibly from a base in a neighboring cell that uses the same partitionand FLT codeword.

FLT Codewords

FLT messages use the same access codes, number of tones, number ofcodewords and modulation as FLI messages.

FLB Use

The FLB channel is used for transmitting data from the base to a remoteunit. FLB channels occur during non-entry time slots of a frame.Referring to FIG. 24, the FLB span all bursts 346 of the base transmitinterval 342 of a time slot. Constellations for the FLB data include8PSK, 16 QAM, and 32 CROSS. Constellation powers are given in Table 4.The forward link bearer channel uses the same forward error controlcoding used by the RLB.

After receiving an RLI from a RU, if the base has no data to send tothat RU during the frame, it sends a default message with valid trelliscoding and Reed-Solomon coding to the RU. The RU uses the defaultmessage to continue adapting its weights during the frame.

FLBs are sent whenever a FLT is sent. FLBs always follow a FLT.

During non-closed flows the base and RU ensure that both the base and RUencryption engines remain synchronized. The base sends all FLB slots ina frame and updates both the FLB encryption and RLB decryption enginesregardless of whether the base receives a RLI during the frame.Likewise, the RU sends all RLB slots in a frame and updates both the RLBencryption and FLB decryption engines regardless of whether the RUreceives a FLT during the frame. In non-closed flows, the encryptionengines continue to advance regardless of RLI or FLT detection. When thebase does not detect the RLI, it stills formulates a FLB. Both the FLBand FLT are sent with an all-zero base transmit weight vector. Thispermits the encryption engines to advance and remain synchronized withthe RU. Since the base transmit power is set zero there is minimuminterference.

RLB Use

The RLB channel is used for transmitting data from the RU to the base.RLB channels occur on all non-entry time slots. Referring to FIG. 24,the RLB spans all bursts 345 of the RU transmit interval 344 of a timeslot. Constellations for the RLB data include 8 PSK, 16 QAM, and 32CROSS.

The data rate, for the initial RLB messages sent immediately after theRU receives the ranging FLA, is two bits per symbol. The data rate ismodified thereafter to three or four bits per symbol by exchange of MACmessages based on the ability of the RU to transmit 3 or 6 dB morepower, respectively.

When the RU has no data to send to the base during a frame of a flow,the RU sends a default message with valid trellis coding andReed-Solomon coding to the base so that the weights can continue toadapt during the frame.

Remote Unit Synchronization

A preferred embodiment for frequency synchronization of a remote unitwith the corresponding base is described herein. The RU uses FLS symbolsto synchronize with the base station in both time and frequency. The RUperforms synchronization acquisition shortly after the remote unit ispowered up and if synchronization is lost during normal operation.Synchronization of the RU includes estimating the frequency offset andthe delay offset of the forward link data transmitted from the baserelative to the RU.

The frequency estimator uses a FLS message transmitted in the first andfourth burst in a forward link entry slot, as described previously. Forexample, a 4 by 6 layout has eight entry slots per time slot. Referringback to FIGS. 26 and 29, a single FLS message is spread over 8frequencies; four of the spread frequencies are partitions in a singlesubband, and the other four are in the paired subband.

The FLS messages are constant modulus codes unique to a given base. Thecode has BPSK modulation in a preferred embodiment. Other modulations,such as QPSK, 8-PSK, 16 QAM, AND 32 CROSS can also be used. The FLSmessages from a particular base have low correlation with FLS messagesfrom other bases. Also, a FLS message has low correlation with itselfand nonzero time lags. Furthermore, the codeword in the fourth FLS burstdoes not resemble a constant times the codeword in the first FLS burst.For this configuration, a code of length 32 is sufficient. The code issplit into two codewords for the two FLS bursts in a forward link entryslot.

A 32-element vector containing the code is multiplied by a complex gainfor each of the 8 spread partitions. For each partition, the resulting32 complex elements are split between the two FLS bursts. The FLS of thefirst burst has the first 16 complex elements and the FLS of the fourthburst has the second 16 complex elements. The base then transmits thecode over the assigned FLS partitions. The code is received at the RU inits corresponding FLS partitions with an unknown frequency error due tothe independence of the RU's voltage controlled crystal oscillator(VCXO). For initial acquisition, a frequency offset is estimated byapplying a maximum likelihood objective function to frequency shiftedand time shifted versions of the FLS data. Once the initial search iscompleted, a tracking frequency estimate is obtained by measuring thephase change between bursts after an appropriate set of beamformerweights have been applied.

The frequency estimator uses the lower subband FLS data for initialacquisition. Let V₁ be the received signal matrix. The subscript refersto the first burst. For example, in a 4 by 6 layout with 16 tones perpartition, received signal matrix V₁ has dimensions of 16 by 4. V₄ isthe received signal matrix for the fourth burst. The first step is todemodulate the signal by dividing element by element with thetransmitted signal. Since the desired signal has elements with unityamplitude, this is equivalent to multiplying element by element by theconjugate of the codeword,X ₁(m,n)=V ₁(m,n) c ₁(m)X ₄(m,n)=V ₄(m,n)c ₄(m)  (B1)where X₁(m,n) are the elements of matrix X₁, X₄(m,n) are the elements ofmatrix X₄, and c₁(m) and c₄(m) are the conjugate codeword elements ofthe first and fourth bursts, respectively. The demodulated signal fromthe first and fourth bursts are concatenated to form,

$\begin{matrix}{Y = \begin{bmatrix}X_{1} \\X_{4}\end{bmatrix}} & ({B2})\end{matrix}$A despread signal is formed,

$\begin{matrix}{z = {\begin{bmatrix}z_{1} \\z_{4}\end{bmatrix} = {Yw}}} & ({B3})\end{matrix}$where w is the despreading weight vector. If there were no noise, delayerror or frequency error, the despread signal vector would be an idealsignal vector of all ones. The demodulated signal despread by theweights approximates the desired signal, s,Yw≈s  (B4)A QR decomposition of Y such that,QR=Y  (B5)and substituting equation (B4) into equation (B5) gives,QRw≈s  (B6)Solving equation (B6) for the despreading weight vector yields,w=R⁻¹Q^(H)s  (B7)where Q is orthonormal,Q^(H)Q=I  (B8)Q is separated into its first and fourth bursts,

$\begin{matrix}{Q = \begin{bmatrix}Q_{1} \\Q_{4}\end{bmatrix}} & ({B9})\end{matrix}$The desired signal s is separated into its first and fourth bursts andmodeled as follows,

$\begin{matrix}{s = \begin{bmatrix}d \\{d\;\alpha}\end{bmatrix}} & ({B10})\end{matrix}$where d is a phase delay ramp vector with each element,d _(k) =e ^(−j2πf) ^(b) ^({circumflex over (τ)}ki)  (B11)where f_(b)=3125 Hz is the bin spacing, for example, and {circumflexover (τ)} is the delay step size. The variable i ranges from −1 to +1 insteps of 1 to generate phase ramps with delays −{circumflex over (τ)},0, and +{circumflex over (τ)}. The phase delay ramp of equation (B11) isformed during coarse state of synchronization processing, describedlater.

Substituting equations (B9) and (B10) into equation (B7) gives,

$\begin{matrix}\begin{matrix}{w = {R^{- 1}\left( {{Q_{1}^{H}d} + {\alpha\; Q_{4}^{H}d}} \right)}} \\{= {R^{- 1}\left( {q_{1} + {\alpha\; q_{4}}} \right)}}\end{matrix} & ({B12})\end{matrix}$where the correlation vectors are,q₁=Q₁ ^(H)d, q₄=Q₄ ^(H)d  (B13)A frequency compensated vector v is,v=q ₁ +αq ₄  (B14)The α that maximizes the magnitude-squared length of v and having aconstant modulus is,

$\begin{matrix}{\alpha = \frac{q_{1}^{H}q_{4}}{{q_{1}^{H}q_{4}}}} & ({B15})\end{matrix}$The detection statistic is related to the correlation coefficientsquared,

$\begin{matrix}{\rho_{b} = {\frac{v^{H}v}{2\; N_{s}} = \frac{{{q_{1} + {\alpha\; q_{4}}}}^{2}}{2N_{s}}}} & ({B16})\end{matrix}$where N_(s) is the number of symbols per FLS burst, N_(s) is 16 for thisexample. The correlation coefficient is used for delay estimation,described later. The SINR estimate is,Error! Objects cannot be created from editing field codes.  (B17)The signal quality is for the nth time slot is the square root of theSINR,s(n)=√{square root over (γ)}  (B18)The signal quality is used for delay estimation, described later.

The frequency error estimate is related to the phase progression fromthe first burst to the fourth burst in the n^(th) time slot as follows,

$\begin{matrix}{{y(n)} = \frac{\arg(\alpha)}{2\pi\; 3\;\tau_{b}}} & ({B19})\end{matrix}$where τ_(b) is burst duration.

The despread signal bursts z₁ and z₄ are calculated based on equations(B3), (B5) and (B12) as follows,

$\begin{matrix}{z = {Qv}} \\{\begin{bmatrix}z_{1} \\z_{4}\end{bmatrix} = \begin{bmatrix}{Q_{1}v} \\{Q_{4}v}\end{bmatrix}}\end{matrix}$

The despread signal bursts z₁ and z₄ are combined with the frequencyerror removed,r=z ₁ +α*z ₄  (B20)If there were no delay error, noise, or interference, thedemodulated-despread signal would simply be, r=2d. Delay errors cause rto exhibit a phase ramp. The slope of the phase as a function offrequency is proportional to the delay error. For an exemplaryembodiment, the delay error is estimated using the lag 8 correlation ofthe demodulated-despread signal,

$\begin{matrix}{\chi_{8} = {\sum\limits_{k = 0}^{k = 7}{r_{k}^{*}r_{k + 8}}}} & ({B21})\end{matrix}$The time delay error estimate with units of seconds is,

$\begin{matrix}{\tau = {- \frac{\arg\left( \chi_{8} \right)}{2\pi\; 8\; f_{b}}}} & ({B22})\end{matrix}$The coarse time delay error estimate with units of clocks (for example,each clock being 13.0283 ns, the reciprocal of F_(C)=76.8 MHz) is,

$\begin{matrix}{{t(n)} = {{- \frac{F_{C}}{2\pi\; 8\; f_{b}}}{\arg\left( \chi_{8} \right)}}} & ({B23})\end{matrix}$which is valid if the magnitude of the actual time delay error, |t(n)|,is less than the ambiguity caused by the arctangent function of 20 □s.

Frequency Locked Loop

FIG. 36 illustrates a frequency locked loop for RU synchronization 460.Frequency error estimate y(n) from equation (B19) added by adder 462 tof₀, the desired center frequency. For every time slot n, subtractor 464generates frequency error b(n) of the RU oscillator. A positive errormeans that the frequency of the phase lock loop (PLL) of the RU ishigher than the base. A quality factor is derived which is proportionalto the square root of the SINR, s(n) using equation (B18). Previousquality factors are averaged for generating weights of a frequencysmoothing filter 466. A predetermined number, typically twelve, previousquality factors are averaged. Frequency smoothing filter 466 computes aweighted frequency error e(n) using the average of the previous qualityfactors, as follows,

$\begin{matrix}{{e(n)} = {\frac{12\;{s(n)}}{\sum\limits_{i = 0}^{11}{s\left( {n - i} \right)}}{{b(n)}.}}} & ({B24})\end{matrix}$The frequency smoothing filter de-emphasizes those time slots for whichthe RU receives a low power FLS. The weighted frequency error e(n) isapplied to the digital loop filter 468. The loop gain, K, and the filtercoefficient h₁ are selected so the composite response of the frequencylocked loop has the desired characteristics. The word width of theoutput of the digital loop filter is at least 26 bits wide so as toreduce the effects of quantization noise. The digital loop filter 468produces w(n) as follows,w(n)=(KK _(c) K _(f))e(n)+(KK _(c) K _(f) h ₁)e(n−1)  (B25)where K_(c) is the compensation gain and is usually equal to 1. K_(f) isthe gain for fixed point processing to drive down the quantizationnoise. A typical value for K_(f) is 64.

The integrator 470 integrates the output w(n) of the loop filter. Thisintroduces a pole at d.c. which turns into a zero at d.c. when the loopis closed. The output x(n) of the integrator 470 is,x(n)=x(n−1)+w(n).  (B26)

The quantizer 472 prepares the output of the integrator for a registerin a digital to analog converter 474, or DAC, in an ASIC by rounding,scaling, offsetting, and clipping. K_(f) is a power of 2 so as tofacilitate the scaling operation. For example, for the DAC expectingoffset binary in a 20-bit register, the quantizer 472 provides quantizedsignal q(n) as follows,

$\begin{matrix}{{q(n)} = {\min\left\{ {{\max\left\lbrack {{\left\lfloor \frac{{x(n)} + \frac{K_{f}}{2}}{K_{f}} \right\rfloor + \frac{q_{0}}{2}},0} \right\rbrack},{q_{0} - 1}} \right\}}} & ({B27})\end{matrix}$where q₀=2²⁰=1048576. Analog lowpass filter 476 and voltage controlledcrystal oscillator (VCXO) and PLL 478 produce an actual oscillatorfrequency f(n) according to methods known in the art.

Delay Estimation

A weighted average of the time error from equation (B23) is calculatedas follows,

$\begin{matrix}{{e_{t}(m)} = \frac{\sum\limits_{i = 0}^{N - 1}{{s\left( {{mN} + i} \right)}{t\left( {{mN} + i} \right)}}}{\sum\limits_{i = 0}^{N - 1}{s\left( {{mN} + i} \right)}}} & ({B28})\end{matrix}$where N is the number of slots used to compute the average, s(n) is thesquare root of the SINR as computed from equation (B18), and e_(t)(m) isthe decimated sequence of averaged time delay error. For time slotduration of 3⅓ ms and the number of time slots N set to 300, theaveraged time delay error would be available once every second. The s(n)of equation (B18) and the weighted average of the time error e_(t)(m) inequation (B28) can be calculated once per time slot. The division can becalculated once per N slots.

Every N slots, the average time delay error is rounded to the nearestinteger and then applied to the receive gate,q(m)=└e _(t)(m)+0.5┘  (B29)

The noise gain is the ratio of the output standard deviation to theinput standard deviation,

$\begin{matrix}{g_{n} = {\frac{\sigma_{e}}{\sigma_{t}} \approx \frac{1}{\sqrt{N}}}} & ({B30})\end{matrix}$where σ_(t) is the standard deviation of the coarse time delay errorestimate, t(n). The RMS delay error of the RU, σ_(e), must be less thanthe amount of link impairment allocated to timing error. For an examplesystem, link impairment allocated to timing error is 0.14 μs. Equation(B30) can be used to determine the number of slots N to average toensure that σ_(e) is less than 0.14 μs. As a performance metric, anestimate of the standard deviation of the delay error is,

$\begin{matrix}{{\sigma_{e}(i)} = \sqrt{\frac{1}{K_{U}}{\sum\limits_{m = 0}^{K_{U} - 1}{e_{t}^{2}\left( {{K_{U}i} + m} \right)}}}} & ({B31})\end{matrix}$where K_(U) is the number of receive gate updates over which thestatistic is collected.

Synchronization has four states, including coarse, frame, fine, andtrack. FIG. 37 gives a top-level state diagram of synchronizationacquisition. Time synchronization refers to the time alignment of areceive gate in the RU.

The first state is the coarse state 482. When this state is entered, theremote unit receive gate may be in error by one-half of a time slot, or+/−1667 μs for this example. In addition, the baseband frequency errormay be +/−40 bins, or +/−125 KHz. Frequency error is a direct result ofthe crystal oscillator tolerance, which could be as large as 50 ppm.

Either the lower subband or upper subband tones are used for coarsestate synchronization in order to reduce the processing load. Otherembodiments with higher performance processors could use both lower andupper subband tones.

The coarse estimation begins by assuming a receive gate delay andcomputing detection statistics at frequency bin boundaries. Coarseestimation uses the detection statistic ρ_(b) given by equation (B16).This statistic will peak when the receive gate delay error is small, andthe received FLS data under consideration are aligned with the FLSsymbols. The receive gate setting and the frequency error which maximizethe detection statistic are used as coarse estimates.

To speed the search, only the FLS base code elements are used in thecomputation of the detection statistic. The FLS base code elements arethe lower 12 tone gains of the FLS partition. Since all the FLS codesequences from a particular base share the same base code elements, thedetection statistic can be computed by correlating to a single base codeas opposed to all FLS codes. When the FLS base code elements are used,the detection statistic ρ_(b) is independent of the slot number. Thedetection statistic will peak when the received FLS data are aligned toany FLS code. This causes frequency error ambiguity to be integermultiples of one partition. Later, the frame state will correct for thisambiguity by correlating with all the elements of each FLS code.

An assumed receive gate delay is composed of two delays. The first isthe actual delay of the receive gate in the RU hardware, and the secondis the simulated delay of the receive gate relative to the actual gate.This simulated delay corresponds to {circumflex over (τ)} in equation(B11). By simulating a delay, multiple receive gate delays can beanalyzed with the same input tones.

The periodicity of FLS partitions in a superframe is used to efficientlylocate an initial frequency bin index of a FLS partition. The coarsestate performs hypothesis testing of candidate frequency errors spacedat intervals of one frequency bin. For the example in FIG. 61, everysixth partition in each time slot is a FLS partition. For this example,the coarse state performs hypothesis testing of candidate frequencyerrors covering six partitions in a time slot. For each assumed receivegate delay, ninety-six detection statistics using equation (B16) arecomputed for every time slot. For a given delay, statistics areaccumulated over multiple time slots.

Because the detection statistic peak may be very narrow, it may bemissed if it lies midway between two bins. In order to overcome thissituation, the maximum statistic resulting from one complete test of allgate delays is compared to a threshold. If the maximum statistic doesnot exceed this threshold, the oscillator is tuned within a fraction ofa bin, and all the hypothesis tests are repeated. If all the frequencieshave been tested prior to exiting the coarse state synchronizationacquisition, control is returned to the control software with a messageindicating failure to synchronize.

Frame State

After successful coarse state synchronization, frame statesynchronization 484 of FIG. 37 is entered. Because only base codes wereused in the coarse state, there may a frequency error ambiguity. Framestate synchronization determines and corrects for this ambiguity. Framestate synchronization also aligns the remote unit frames with the basestation frames.

The inputs from the coarse state are the frequency bin index and theslot number at which the detection statistic peaked. Referring to FIG.61 for a spreading factor of two, in every time slot, one of twelve FLScodes is transmitted in a FLS partition in an entry slot. The coarsestate frequency bin index is within an integer multiple of sixteen tonesof a FLS partition. Referring to FIG. 62 for a spreading factor of four,in every other time slot, one of six FLS codes are transmitted in a FLSpartition which is within an integer multiple of sixteen tones of thecoarse state frequency bin index. Because each FLS code sequence istransmitted in a specific time slot of a superframe, the time slotnumber can be determined. In addition, because each FLS code sequence isin a specific partition for a particular time slot in a superframe, thepartition number can be determined. The frame state correlates thereceived FLS tone gains with each of the known FLS codes. When a strongmatch is found, both frequency and time alignment can be determined.

As for the coarse state, the frame state processes either the lowersubband or upper subband tones. Frame state estimation includes twosteps. The first step determines which partition is active for thecurrent time slot by correlating candidate partitions of the input datawith the FLS base code. As for the coarse state, only the gains of lowertwelve tones of the candidate partitions are correlated with the knownFLS base code. The initial bin of a candidate partition is an integermultiple of the number of tones per partition of the coarse statefrequency index. The integer multiple corresponds to the spacing betweenthe periodic entry slots. The detection statistic of equation (B16) isused for hypothesis testing of receive gate delays. Hypothesized receivegate delays are spaced at intervals of a time slot duration. Referringfor example to FIG. 61, this corresponds to testing for the verticallocation of a FLS partition along a diagonal. Six detection statistics,one for each hypothesized receive gate delay, are computed for everytime slot. This corresponds to searching over one frame. The detectionstatistic peak indicates the first frequency bin of an active partitionin the current time slot. This frequency bin is used to determine thebin that marks the beginning of the active partition for the next timeslots. For the example of FIG. 61, for the index for the next time slotis shifted by one partition, or sixteen frequency bins, to move along adiagonal. The output of the frame state's first step is the frequencybin index of an active partition in a given time slot.

In the second step, the particular FLS codeword received in each timeslot is determined. Beginning with the frequency bin index of the activepartition, all of the tones for the active FLS partition are extractedand correlated to each of the FLS codes. For this example, the number oftones used is equal to sixteen. In addition, for each FLS code multiplesimulated receive gate delays corresponding to {circumflex over (τ)} inequation (B11) are analyzed. The range of simulated delays depends onthe coarse state time accuracy. For example, the range of simulateddelays tested are in equally spaced intervals from −10 μs to +10 μs.

For every active partition and time slot, a SINR is estimated usingequation (B17) for every FLS code and for multiple simulated receivegate delays. In order to cycle through all the FLS codes, this operationis repeated for all the time slots in a superframe. For each time slot,the input tones used for this correlation correspond to the active FLSpartition tones. The SINR for active partitions are computed over asuperframe as a function of time and frequency bins. The SINRs of activepartitions form peaks along diagonals in time and frequency binscorresponding to diagonals in FIG. 61. Next, the SINR values areaccumulated along the diagonals. The diagonal with the largestaccumulated SINR begins with the SINR corresponding to the FLS receivedin the first time slot. From the largest accumulated SINR, thesuperframe time slot number, the frequency error, and the receive gateerror are estimated.

If this largest accumulated SINR does not exceed a specified threshold,control is returned to the coarse state. Otherwise, the fine state isexecuted. Control is also returned back to the coarse state if thefrequency error lies outside of a maximum allowable range related to theVCXO tolerance.

Fine State

The fine state 486 of FIG. 37 further reduces both the frequency andtime errors to a range appropriate for tracking. The fine state performshypothesis testing of different VCXO frequencies and receive gatedelays. For each operating point, the SINR of equation (B17) isestimated and accumulated over a predetermined number of frames. Theoperating point that maximizes the accumulated SINR corresponds to theminimum synchronization error. For example, VCXO frequencies consideredare the current frequency, and seven frequencies which are spacedinteger multiples of one-eighth of a bin from this frequency. For eachone of these frequencies, simulated receive gate delays are analyzed arerelative to the current delay. Changing the slope of the delay rampusing equation (B11) varies the simulated delays. These delays rangefrom −10 μs to +10 μs, in equally spaced intervals. Since the frequencyerror is very small when this state is entered, the difference betweenthe low subband frequency error and the high subband frequency error isalso very small. For this reason, all frequencies are analyzed for eachFLS symbol. For a frequency spreading factor of 2, the four frequenciesin the lower subband and four frequencies in the upper subband areanalyzed for each FLS symbol. All sixteen FLS symbols are used.

In addition to the SINR computations, a weighted phase progressionphasor α(n) is also accumulated over the time slots for each operatingpoint. The α(n) is calculated according to equation (B15) for the n^(th)time slot. The weighting factor is the square root of the SINR ofequation (B18). Once the best operating point is determined, thecorresponding weighted value is used to estimate a fine frequencyadjustment according to equation (B19). In this equation, the weightedvalue α(n) replaces the arctangent argument.

If the maximum accumulated SINR does not exceed a specified threshold,control is returned to the coarse state. Otherwise, the track state isexecuted.

Track State

The track state 488 of FIG. 37 monitors the received FLS tones over apredetermined number of frames and performs fine delay and finefrequency adjustments. For a spreading factor of 2, the eight partitionscontaining FLS tones are processed and a fine receive gate delay erroris computed according to equation (B23) for every active time slot. Thefine receive gate delay error is passed through the smoothing filtergiven by equation (B29) prior to writing it into a hardware registercontrolling the receive gate. This filtered value is not written to thehardware every time slot. Rather it is written every N time slots. Inaddition, the fine frequency error is also computed according toequation (B19). The fine frequency error is passed through the chain offilters given by equations (B24) to (B27) prior to writing it into thehardware registers which control the voltage controlled oscillator 978of FIG. 36.

Physical Layer Processing of RLI

FIG. 38 illustrates operation by the base receiver in a preferredembodiment for RLI and RLB data processing 500. Many of the operationsare analogous to the embodiment for base receiver operation illustratedin FIG. 1. Preamble data of input 501 to the RLI processing section 502,include RLI codewords of transmitting remote units. Preamble detectionblock 508 detects RLI codewords. In a preferred embodiment RLI codewordsare derived from Hadamard basis functions. In this case, the fasttransform processor 506 uses a Hadamard transform. The compute weightsblock 510 provides initial despreading weights. For the remainder of aframe, the weights are updated using a decision-direction algorithm aspart of RLB processing 504.

A specific example of a preferred embodiment described herein. The RLIis 64 complex symbols long comprising 4 bursts of 16 tones. The RLI codeis therefore 64 unique complex elements long. The RLI code has in-phaseand quadrature components taken from the columns of a length 64 Hadamardmatrix,p _(ik) =h _(i) +jh _(k) , i≠k  (C1)where h_(i) is a particular column from the Hadamard matrix H. Theindices i and k select a particular RLI code. There are 64×63=4032possible RLI codes. This embodiment does not use a base scrambling code.The RLI codes have a separation of 60 degrees or more; cos(60°)=0.5,

$\begin{matrix}{{{p_{ik}^{H}p_{in}} \leq \frac{N}{2}},{n \neq k}} & ({C2})\end{matrix}$The base receives the RLI codes from the various remote units and formsa received matrix, X_(p) (N_(p)=64 complex samples by K_(base)=32sensors). The received signal, when multiplied by the weight vector, isthe RLI code except for the error introduced by the channel,X _(p) w _(ik) =p _(ik) +e  (C3)QR decomposition is performed on X_(p) yielding Q and R.X _(p) =QR  (C4)Substituting equation (C3) into equation (C4) yields,QRw _(ik) =p _(ik) +e  (C5)Using the fact that the Q matrix is orthonormal,Q^(H)Q=I  (C6)equation (C5) is pre-multiplied by QH to obtain,Rw _(ik) =Q ^(H) p _(ik) +Q ^(H) e  (C7)Since the error e is orthogonal to Q, a weight vector is given by,w _(ik) =R ⁻¹ Q ^(H) p _(ik)  (C8)

A fast Hadamard transform operates on Q to calculate,V=Q^(H) H  (C9)The fast Hadamard transform is more efficient than a FFT because itinvolves adds and subtracts, but no complex multiplies. Theimplementation of equation (C9) is not calculated as a matrixmultiplication but rather as Kbase fast Hadamard transforms, one foreach sensor. V is Kbase=32 sensors by Np=64 codes. V can be considered aset of column vectors,V=[v₁v₂ . . . V_(N)]  (C10)where each column vector is,v_(i)=Q^(H) h _(i)  (C11)The correlation of the Q matrix with a particular RLI code is,z_(ik)=Q^(H)p_(ik)  (C12)Substituting equation (C1) into equation (C12) gives,z _(ik) =Q ^(H)(h _(i) +jh _(k))  (C13)Substituting equation (C10) into equation (C13) gives,z _(ik) =v _(i) +jv _(k)  (C14)The detection statistic is,

$\begin{matrix}{\rho_{ik} = \frac{{z_{ik}}^{2}}{2N}} & ({C15})\end{matrix}$If the statistic is greater than a threshold ρ_(T), then the RLI isdetected,if ρ_(ik)≧ρ_(T) then code ik is detected  (C16)

For those codewords which are detected, the desired cross-correlation isformed using equation (C12),R_(QP)=[z_(ij)z_(kl) . . . z_(mn)]  (C17)and the weight matrix is organized in a similar fashion,W=[W_(ij)w_(kl) . . . w_(mn)]  (C18)Converting the vector form of equation (C7) to a matrix form suggestedby equation (C17) and equation (C18), gives,RW=R_(QP)  (C19)Noting that R is upper triangular, equation (C19) can be readily solvedfor W by back-substitution.

In review, the base performs the following signal processing for RLIdetection.

-   -   calculates a QR decomposition according to equation (C4);    -   calculates the a fast Hadamard transform for each of K_(base)        sensors forming the V matrix of equation (C9);    -   adds the i^(th) column to the k^(th) column for all of the RLI        codes, ik, which are active on the particular partition        according to equation (C14);    -   finds the magnitude squared of the each candidate vector z_(ik)        according to equation (C15);    -   compares its magnitude squared with a threshold according to        equation (C16).        For the initial weight vector selection, the base signal        processing organizes the desired cross-correlation matrix per        equation (C17) from the intermediate values previously        calculated by equation (C14) and then uses R from the QR        decomposition to find the weight vectors using equation (C19).

The following description derives a detection statistic for equation(C15) and detection threshold for equation (C16).

Substituting equation (C8) into equation (C7) yields,e=QRR ⁻¹ Q ^(H) p _(ik) −p _(ik)  (C20)The error power due to noise, interference, excessive number of RUssending a RLI, etc. is e^(H)e,e ^(H) e=(QQ ^(H) p _(ik) −p _(ik))^(H)(QQ ^(H) p _(ik) −p _(ik))  (C21)which can be simplified using equation (C6) to,e ^(H) e=p _(ik) ^(H) p _(ik) −p _(ik) ^(H) QQ ^(H) p _(ik)  (C22)Each term of equation (C22) is defined as follows. σ_(e) ² is thenormalized noise plus interference power.σ_(e) ²=e^(H)e  (C23)σ_(p) ² is the normalized ideal signal power.σ_(p) ²=p_(ik) ^(H)p_(ik)  (C24)σ_(s) ² is the normalized received signal power.σ_(s) ²=p_(ik) ^(H)QQ^(H)p_(ik)  (C25)The received signal power to noise plus interference power ratio is,

$\begin{matrix}{\gamma = {\frac{\sigma_{s}^{2}}{\sigma_{e}^{2}} = \frac{p_{ik}^{H}Q\; Q^{H}p_{ik}}{e^{H}e}}} & ({C26})\end{matrix}$Substituting equation (C22) into equation (C26) yields,

$\begin{matrix}{\gamma = \frac{\rho_{ik}}{1 - \rho_{ik}}} & ({C27})\end{matrix}$where ρ_(ik) is related to a correlation coefficient squared and is usedas the subsequent detection statistic,

$\begin{matrix}{\rho_{ik} = {\frac{\sigma_{s}^{2}}{\sigma_{p}^{2}} = \frac{p_{ik}^{H}Q\; Q^{H}p_{ik}}{p_{ik}^{H}p_{ik}}}} & ({C28})\end{matrix}$The SINR of equation (C27) can expressed in decibels,dB=10 log₁₀(γ_(ik))  (C29)

The following description and equations are useful for calculatingaverage and peak tone powers at an antenna.

A model for the received signal X has two components, one is the signalspread by w_(ik) ^(H), and the other is a noise matrix, N,

$\begin{matrix}{X = {{p_{ik}\left( \frac{w_{ik}^{H}}{w_{ik}^{H}w_{ik}} \right)} + N}} & ({C30})\end{matrix}$Substituting equation (C35) into equation (C5) yields,Nw_(ik)=e  (C31)Expressed another way, a noise matrix, N, is one of many possiblematrices which when multiplied by w_(ik) ^(H), yields the error vector,e. The normalized noise plus interference power, from equation (C23)becomes,σ_(e) ²=e^(H)e=w_(ik) ^(H)N^(H)NW_(ik).  (C32)Assuming that the noise from one antenna is uncorrelated with the noisefrom the other antennas, the noise correlation matrix is modeled as,N^(H)N=σ_(n) ²NI.  (C33)where σ_(n) ² is the average noise power per symbol in each degree offreedom, Np is the number of symbols in the RLI (the length of thep_(ik) vector), and I is a Kbase by Kbase identity matrix where Kbase isthe number of degrees of freedom. Solving equations (C26), (C27), (C28),(C32), and (C33) for the average noise power per symbol yields,

$\begin{matrix}{\sigma_{n}^{2} = {\frac{\sigma_{p}^{2}}{{N_{p}\left( {1 - \rho_{ik}} \right)}w_{ik}^{H}w}.}} & ({C34})\end{matrix}$For RLIs, σ_(p) ²=2N_(p). The noise power for a typical tone for atypical degree of freedom is,P _(n)=10 log₁₀(σ_(n) ²).  (C35)where the subscript n means that it is the noise power.The cross-correlation of the signal term of equation (C30) is,

$\begin{matrix}\begin{matrix}{R_{pp} = {\left\lbrack {p_{ik}\left( \frac{w_{ik}^{H}}{w_{ik}^{H}w_{ik}} \right)} \right\rbrack^{H}\left\lbrack {p_{ik}\left( \frac{w_{ik}^{H}}{w_{ik}^{H}w_{ik}} \right)} \right\rbrack}} \\{= {\left\lbrack \frac{\sigma_{p}^{2}}{\left( {w_{ik}^{H}w_{ik}} \right)^{2}} \right\rbrack w_{ik}w_{ik}^{H}}}\end{matrix} & ({C36})\end{matrix}$The diagonal terms rpp are the signal powers for each degree of freedom,

$\begin{matrix}{r_{pp} = {\left\lbrack \frac{\sigma_{p}^{2}}{\left( {w_{ik}^{H}w_{ik}} \right)^{2}} \right\rbrack{{{diag}\left( {w_{ik}w_{ik}^{H}} \right)}.}}} & ({C37})\end{matrix}$The typical tone power at an antenna would be the average of thediagonal terms,

$\begin{matrix}{P_{a} = {10\;{{\log_{10}\left( {\frac{1}{K}{\sum\limits_{i = 1}^{K}{r_{pp}(i)}}} \right)}.}}} & ({C38})\end{matrix}$Likewise, the peak tone power at the best antenna would be the largestof the diagonal terms,P _(m)=10 log₁₀(max(r _(pp)))  (C39)

PLB Processing

Once the initial weights have been computed for each detected RLImessage, the weights are updated using the subsequent bearer trafficwith a decision-direction algorithm. Referring to FIG. 38 in the RLBprocessing section 504, weights 514 are applied to data 513 from the RLBchannel by beamformer block 514 to form output symbols 516 that aresubsequently decoded by decoder 518 to form output bits 519. Thebeamformer block 514 uses the initial weights 512 to provide beamformingand null steering gain. The output bits 519 are then re-encoded by theform symbols block 520. The cross-correlator 524 uses the re-encodedsymbols S on line 522 to form cross-correlation R_(XS). The compute newweights block 526 provides updated weights W on line 528. These updatedweights are then available for application to subsequent block of inputRLB data on line 513.

FLI Processing

The base performs two primary operations for FLI processing. The firstis obtaining the correct code for the RU that is being signaled anduploading it to the transmitter. The second is computing the transmitgains that will be used to transmit the FLI waveform. The transmit codeswill be stored in memory indexed by the RU number. Also stored in memoryare the best transmit weights found so far. Ideally, there is a set oftransmit weights for each partition and each RU. The last computedtransmit weights used by the RU would be stored in memory. If a RU hadnot used a given partition, the weights from the closest partition lastused by network can be used.

The transmit weights for the FLA and FLI messages for a particular RUare computed using a decision-directed method similar to that of the RLBprocessing section 504 of FIG. 38 for updating base receiver despreadingweights. The following description considers forming a transmit weightvector for a single RU and a frame length of six time slots. As forupdating the receiver despreading weights, the base computes thecross-correlation between a base received RLB data and a re-encodedsymbol vector to form R_(XS)(6n+s), where n is the frame number, and sis the slot number, 0≦s<6 for six time slots per frame. Thecross-correlation R_(XS)(6n+s) is a vector, corresponding to one columnof the matrix R_(XS) output from the form cross-correlation block 524 ofFIG. 38.

As previously described, a scaled version of the conjugate of the basereceive weights forms initial base transmit weights,w_(BT)=κ_(fwd)w*_(BR)  (D1)where w_(BR) is a vector of base receive weights and w_(BT) is a vectorof base transmit weights for FLA or FLI. The cross-correlation matrix isexponentially averaged over the time slots in a frame,{circumflex over (R)} _(XS)(6n+1)=R _(XS)(6n+1){circumflex over (R)} _(XS)(m)=(1−β₁)R _(XS)(m)+β₁ {circumflex over (R)}_(XS)(m−1)6n+2≦m≦6n+5  (D2)The exponentially averaged cross-correlation is used to calculate theweights at the base during the RLB slots. At the end of the frame, thecross-correlation data, from the last slot, {circumflex over(R)}_(XS)(6n+5) is split into the upper carrier and lower carrierportions,

$\begin{matrix}{\begin{bmatrix}{R_{XSL}(n)} \\{R_{XSU}(n)}\end{bmatrix} = {{\hat{R}}_{XS}\left( {{6n} + 5} \right)}} & ({D3})\end{matrix}$

The previous FLA or FLI transmit weight vector, w_(BT)(n−1), is alsosplit into the lower and upper carrier weights,

$\begin{matrix}{\begin{bmatrix}{w_{BTL}\left( {n - 1} \right)} \\{w_{BTU}\left( {n - 1} \right)}\end{bmatrix} = {w_{BT}\left( {n - 1} \right)}} & ({D4})\end{matrix}$De-rotation values α_(L) and α_(U) map the cross-correlation vectors tothe transmit weight vectors,w _(BTL)(n−1)≈α_(L)(n)R _(XSL)(n)w _(BTU)(n−1)≈α_(U)(n)R _(XSU)(n)  (D5)These de-rotation values accommodate the time varying phase differencebetween the lower carrier and upper carrier whether the difference isfrom the RU or from the propagation channel. Solving equation (D5) forthe de-rotation values gives,

$\begin{matrix}{{{\alpha_{L}(n)} = \frac{{w_{BTL}^{H}\left( {n - 1} \right)}{w_{BTL}\left( {n - 1} \right)}}{{w_{BTL}^{H}\left( {n - 1} \right)}{R_{XSL}(n)}}}{{\alpha_{U}(n)} = \frac{{w_{BTU}^{H}\left( {n - 1} \right)}{w_{BTU}\left( {n - 1} \right)}}{{w_{BTU}^{H}\left( {n - 1} \right)}{R_{XSU}(n)}}}} & ({D6})\end{matrix}$The numerator of equation (D6) is the magnitude squared of the transmitweight vector. Since the same power is transmitted on the lower carrierand the upper carrier, the numerator of equation (D6) is replaced withthe desired transmit power, □□,

$\begin{matrix}\begin{matrix}{{\alpha_{L}(n)} = \frac{\gamma_{H}}{{w_{BTL}^{H}\left( {n - 1} \right)}{R_{XSL}(n)}}} \\{{\alpha_{U}(n)} = \frac{\gamma_{H}}{{w_{BTU}^{H}\left( {n - 1} \right)}{R_{XSU}(n)}}}\end{matrix} & ({D7})\end{matrix}$The total desired transmit power is split equally between the uppercarrier and the lower carrier,

$\begin{matrix}{\gamma_{H} = \frac{\gamma_{EIRP}}{2}} & ({D8})\end{matrix}$If the magnitude squared of the denominator of equation (D7) is lessthan a prescribed threshold, then the transmit weights are not updated.Else, a recursive update is performed,w _(BTL)(n)=β₂ w _(BTL)(n−1)+(1−β₂)α_(L)(n)R _(XSL)(n)w _(BTU)(n)=β₂ w _(BTU)(n−1)+(1β₂)α_(U)(n)R _(XSU)(n)  (D9)The update coefficient β₂ is selected so as to be fast enough to trackthe changes in the antenna aperture, but slow enough to smooth out thefluctuation of the cross-correlation.

If there is not a previous weight, for instance if the RU was justcommissioned, equation (D9) becomes,

$\begin{matrix}\begin{matrix}{{w_{BTL}(0)} = {\sqrt{\frac{\gamma_{H}}{{R_{XSL}^{H}(0)}{R_{XSL}(0)}}}{R_{XSL}(0)}}} \\{{w_{BTU}(0)} = {\sqrt{\frac{\gamma_{H}}{{R_{XSU}^{H}(0)}{R_{XSU}(0)}}}{R_{XSU}(0)}}}\end{matrix} & ({D10})\end{matrix}$

An alternative computation of FLI transmit weight is now described. Thetransmit weights for the FLI codes can also be computed using dominantmode prediction. The available cross-correlation R_(XS) computed over aset of partitions and time slots are stored as column vectors in amatrix M. The cross-correlation statistics are computed during thenormal course of the base traffic beamforming algorithm, defined by,R_(XS)=X^(H)s  (E1)where X is the complex received signal matrix and s is the informationsymbol reference signal for the given link. It is found either from aknown or hypothesized RLB sequence, or as an interim output from thedecoder for use in decision feedback. The actual transmit weights, g,for a given partition will be a scaled version of u, the dominant modeof MM^(H), which is the eigenvector associated with the largesteigenvalue. The next step is to compute the Cholesky factor of MM^(H),R_(M) ^(H)R_(M)=MM^(H)  (E2)The power method is used to recursively update a guess of the dominantmode,v(n)=R _(M) ^(H)(R _(M) u(n−1))  (E3)

$\begin{matrix}{{u(n)} = \frac{v(n)}{{v(n)}}} & ({E4})\end{matrix}$p(n)=∥u(n)−u(n−1)∥²  (E5)

After several iterations, the FLI transmit weight vector is selected,g=γ _(EIRP) u(N)  (E6)An initial estimate for the dominant mode is any copy of thecross-correlation vector used to populate the matrix M,u(1)=R _(XS)  (E7)

Typically, 3 to 5 iterations of equations (E4) to (E5) are sufficient.Iterations are halted when u changes by a small amount; when p(n) isless than a prescribed threshold. The constant γ_(EIRP) is the scalingconstant used to obtain the desired transmit power levels.

FLI Detection by RU

The FLI detection statistic at the RU uses the same formula as thedetection statistic used at the base to detect orthogonal preambles. Nofast transform is needed here of course, since in the nominal situationonly a single code corresponding to the RU is transmitted by the base. Asingle code is assigned to each RU. In the 4 by 6 layout, the RUcomputes a complex signal vector of 16 frequency tones by 2 carriers.The detection statistic formula that is used at the RU is,

$\quad{\rho_{\det} = \frac{c^{H}\left( {X\left( {X^{H}X} \right)} \right)^{- 1}X^{H}c}{c^{H}c}}$where c is the 16×1 vector containing the FLI code for the given RU.

Physical Layer Forward Error-Control

To maintain airlink data integrity while minimizing transmission power,forward error-control codes (FEC) are applied to both FLB and RLB. Theairlink FEC is configured for two types of services, VoIP and data. Theperformance goal for FEC is to achieve a bit error rate (BER) of 10⁻⁶for VoIP and a frame error rate (FER) of 10⁻³ for data. A CRC-likemechanism is also used for data transmission so that after rejectingerror frames the bit error rate can achieve 10⁻¹⁵ or better.

For VoIP applications, a trellis-coded-modulation (TCM) code is used forreduced latency. For data service, the TCM code is concatenated with aReed-Solomon (RS) code. The RS code is also used to generate anautomatic re-transmission request (ARQ) for frame retransmission.

The core of TCM code is constructed from a generic rate-⅔ convolutionalencoder 530 illustrated in FIG. 39. The structure includes an m-stagelinear feedback shift-register circuit 532, multipliers 534 (acting likeon-off switches), and modulo-2 adders 536. Two input bits, v₁ and v₂,are coupled into the shift register and three output bits, u₀, u₁, andu₂, are produced every clock cycle. The feedback connections arecompletely specified by a set of three parity check polynomials, H=[H₀H₁ H₂]. Together they act like a 2^(m)-state state machine. As anexample, for a 64-state (m=6) encoder for a QAM constellation the paritycheck polynomials are,H=[H₀ H₁ H₂]=[110000 000100 1100011]=[060₈ 004₈143₈]

where at the right end of the equation numbers are expressed in octalnotation.

TCM Encoder and Decoder

The convolutional encoder 530 is used in conjunction with two additionalinput bits and a constellation mapper to form a TCM. The TCM can beconfigured for three transmission rates, including 2 bits per symbol, 3bits per symbol and 4 bits per symbol. For 2 bits per symbol, only twoinput bits, [v₁v₂], are accepted and the mapper generates three outputbits, [u₀u₁u₂] for an 8-PSK constellation. The rate for this TCM issimply ⅔. For 3 bits per symbol, an additional input bit, v₃, isaccepted and the mapper outputs a 16-QAM constellation that makes a rate¾ TCM. For 4 bits per symbol, a 4-bit input symbol [v₁v₂v₃v₄]is codedinto 5 output bits [u₀ u₁ u₂ u₃ u₄] and are mapped to a 32-CROSSconstellation; a rate-⅘ TCM. A scalable trellis coded mapper 540 thataccommodates the three transmission rates is illustrated in FIG. 40. Ingeneral, the convolutional encoder 530 outputs [u₀u₁ u₂] represent acoset index and the uncoded bits [u₃u₄] select the member within acoset.

As a specific example, the rate-⅘ TCM is illustrated in FIG. 41. Arate-⅔ convolutional encoder is paired with two additional input bits(v₃ and v₄) to form a rate-⅘ TCM. The three bits, [u₀u₁u₂], coming outof the convolutional encoder 530 of FIG. 39 selects one of the 8 cosets,whereas the uncoded bits, [v₃v₄], which are assigned to [u₃u₄], selectone of the four constellation points within a coset. The cosetconstruction follows directly from Ungerboeck's coset partitioningmethod.

Each frame within a partition is coded as an independent data block. Toreliably terminate the transmission of data block, the encoder makes useof tail-biting at the end of the frame to force the shift registers to aknown state. Because of feedback shift registers are used in theconvolutional encoder, a number of non-zero 2-bit symbols are appendedat the end of data block to the convolutional encoder. The value ofnon-zero symbols depends on the state of m shift registers and the setof parity check polynomials. For example, the 64-state encoder with theparity check matrix shown require up to 4 tail-biting samples. Sinceeach sample includes 2-bits [v₁v₂], 8 tail-biting bits or a byte areneeded. The tail-biting sequence for a specific set of parity checkpolynomials and 2^(m) states is precomputed and stored in the encoder tobe used for terminating a frame of data.

For all three transmission rates, the parity check polynomials are givenin Table 5.

TABLE 5 TCM design Trace back length M States, 2^(m) H2 H1 H0 in samples6 64 066 030 103 28 7 128 024 100 245 28

The TCM decoding is based on the Viterbi algorithm and the decoder istypically called a Viterbi decoder. Since the Viterbi decoder is amaximum-likelihood symbol decoding algorithm, a traceback operation isused. Due to the traceback length, decoding latency is introduced foreach data frame decoding. However, since the encoding is block-based andtail-biting is used to terminate properly, the Viterbi decoder at thereceiver will reach the terminal state at the end of a frame. Therefore,the actual latency for an entire frame is only limited to some hardwareoperating cycles. The rule for choosing a traceback length is aboutthree to five times the number of shift register stages, which issometimes called constraint length, of the convolutional encoder. Forthe three configurations in Table 5, the traceback is implemented with28 2-bit samples. Still, the intra-frame decoding latency can be anissue because of the TDD characteristics in the time slot.

The traffic despreading algorithm updates the despreading weights at theend of each time slot and the Viterbi decoder output is re-encoded to beused as decision-direction symbols. Due to the traceback, only part ofthe samples received during the first FLB time slot are decoded andre-encoded for decision-direction symbols. Because of the 28-symboltraceback length, the impact of the incomplete decision-directionsymbols should be small, equivalent to a reduction in time-bandwidthproduct for computing R_(XS). That is, for the FLB decoding RU receives80 samples and the Viterbi decoder outputs 52 samples in the first timeslot. The 52 samples are immediately re-encoded as 52 decision-directionsymbols for R_(XS) calculation. For the subsequent three time slots, theViterbi decoder output entire 80 samples per slot. At the end of thelast time slot, the Viterbi decoder outputs 80 samples plus theremaining 28 samples in the traceback memory without incurringadditional latency. For the RLB decoding, the Viterbi decoder at baseoutputs 32 samples of the received 60 samples for the first time slot.The operation for the next four slots is similar to FLB decoding.

Table 6 shows a comparison of data rates for time division duplex TDD ofthe present invention and frequency division duplex FDD known in theart. The data rates are shown for a single partition (16 tones 50 KHz)with different modulation constellation sizes from 8 PSK to 64 QAM.Although FDD transfers at twice the data rate of TDD, the TDD of thepresent invention has twice the frequency diversity as FDD.

TABLE 6 PHY and Payload Bytes per Frame per partition ModulationInformation Bits PHY Bytes Per Frame Payload Bytes Per Frame AfterCoding per Symbol Forward/Reverse Forward/Reverse 8 PSK, TDD 2 100/80 80/64 16 QAM, TDD 3 160/128 120/96  32 CROSS, TDD 4 200/160 160/128 64QAM, TDD 5 250/200 200/160 8 PSK, FDD 2 200/200 160/160 16 QAM, FDD 3320/320 240/240 32 CROSS, FDD 4 400/400 320/320 64 QAM, FDD 5 500/500400/400

Table 7 shows the gross bit rate, bit rate to the medium access control(MAC) layer, and payload data rate for various constellation sizes,frame times, and forward error correction codes. A 2.5 MHz activebandwidth, 2 way frequency spreading, and a basic 1.25 MHz subbandbandwidth are assumed. The data payload varies between 3.2 Mbps for lowSINR, requiring small constellation size, to 8 Mbps for high SINR, whichallows large constellation size. The net bit rate does not include sync,training, access, or entry slots from the gross bit rate. The payloadrate further excludes MAC header, CRC, RS, and ranging.

TABLE 7 Data Rates in 2.5 MHz Active Bandwidth Modulation, Frame CodeRate Info Bits/ Gross Bit Rate Bit Rate to Data Payload Time TCH, RSSymbol Guard (Mbps) MAC, Net (Mbps) (Mbps) 8 PSK, 10 ms 2/3, 2, 4.8 4.03.2 (99,91) 7 μs 8 PSK, 20 ms 2/3, 2, 4.8 4.0 3.2 (99,91) 13 μs 16 QAM,10 ms 3/4, (149,133) 3, 7.2 6.0 4.8 7 μs 16 QAM, 20 ms 3/4, (149,133) 3,7.2 6.0 4.8 13 μs 32 CROSS, 4/5, (199,173) 4, 9.6 8.0 6.4 10 ms 7 μs 32CROSS, 4/5, (199,173) 4, 9.6 8.0 6.4 20 ms 13 μs 64 QAM, 10 ms 5/6,(249,217) 5, 12.0 10.0 8.0 7 μs 64 QAM, 20 ms 5/6, (249,217) 5, 12.010.0 8.0 13 μs

Reed-Solomon Encoder and Decoder

For data service, the TCM is used as the inner encoder and isconcatenated with a Reed-Solomon (RS) code as the outer encoder. As theinner code, the TCM configuration is the same as described in Table 5.The RS symbols are drawn from Galois field GF(2⁸) and codeword size isdetermined from the data rate. In general, a rate-k n RS code is denotedby RS(n,k), where k denotes 8-bit dataword size and n is the codewordsize. The maximum codeword size for the RS is n=2⁸−1=255 and the codecan correct up to t=(n−k)/2 8-bit words. The generating polynomial forthe t-error-correcting RS code is given by,

$\begin{matrix}{{g(X)} = {\left( {X + \alpha} \right)\left( {X + \alpha^{2}} \right)\mspace{11mu}\ldots\mspace{11mu}\left( {X + \alpha^{2t}} \right)}} \\{= {g_{0} + {g_{1}X} + {g_{2}X^{2}} + \ldots + {g_{{2t} - 1}X^{{2t} - 1}} + X^{2t}}}\end{matrix}$where α is a primitive element in GF(2⁸) and g₁ are coefficients fromGF(2⁸). A RS encoder 560 corresponding to the generating polynomial isshown in FIG. 42. Again a frame is treated as a single block of data andis encoded into a single RS codeword. In FIG. 42, the multiplications562 are in GF(2⁸) and the additions 564 are bit-wise exclusive-oroperation. The k data samples (bytes) are clocked into the 8-bit wideshift register circuit one sample per cycle and after k clock cycles thedata in the 2t registers are the parity check bytes, which are appendedto the original data bytes to be sent out.

A RS decoder 570 is illustrated in FIG. 43. Generally, five steps areinvolved in a RS decoder and the process starts after a frame of data iscollected. Hence the latency introduced by the RS decoder is about aframe length of 20 ms, assuming the hardware utilizes the full span offrame timing. When n input bytes are available, the partial syndromestep 572 calculates 2t partial syndromes. The syndromes are subsequentlyused in Massy-Berlekamp processor 574 to generate an error-locatorpolynomial and an error-value polynomial. The error-locator polynomialis then sent to the Chien location search processor 576 to identify terror locations, and the error-value polynomial is processed using theForney algorithm 578 to calculate t error values. The error correct step580 in the decoder corrects the t errors in the received data. This RScodec is capable of correcting up to t bytes of errors, regardless ofhow many bits are in error within a byte.

FIG. 44 illustrates a procedure used as an ARQ process for datare-transmission 590. One of the way to check if the RS decoder 570corrects all the errors is to feed the resultant n bytes of data intothe same RS encoder 560. After clocking in the n bytes, the contents ofthe 2t registers are examined by 2t parity bytes check 592. If the 2tregisters are zeros, then the correction is successful. Otherwise, it isan indication that more than t errors are in the received data. If the2t parity bytes are all zeros, the k data samples are deemed as“error-free” data. Otherwise, the frame is rejected and an ARQ signal isgenerated for re-transmission.

Lower Physical Layer Processing

The physical layer transmitter 600 is functionally described by FIG. 45,and is identical for both forward and reverse links. As shown in FIG.45, complex baseband signals 602 enter the tone mapping block 604 wherethey are mapped to appropriate tone locations within a subband. The IDFTbin mapping block 606 maps the tone-mapped complex signals to theirappropriate IDFT bins. The inverse DFT 608 is performed. Remaining IDFTbins are filled with a cyclic prefix 610 after performing the inverseDFT. The discrete time-domain samples are then converted into an analogsignal by D/A conversion block 612 and mixed to the appropriate RFfrequency by RF conversion block 614. RF combiner 616 combines the upperand lower channels prior to transmission over the antenna. There is oneantenna for the reverse channel. For the forward link, the functiondepicted in FIG. 45 is repeated for each antenna element. Furthermore,the tone mapping may represent a combination of symbol data frommultiple users into the same IDFT bin. For this example, the spacingbetween adjacent IDFT bins is 3.125 KHz, and in each 1.25 MHz subbandthere are 400 bins. Thus, a 512-point IDFT would span 1.6 MHz with 112unused bins. The IDFT bin mapping 606 is shown in FIG. 46.

By reducing the process of synthesis, or modulation, and analysis, ordemodulation, to inverse and forward Fourier transforms, the hardwarecomplexity is driven by the implementation of the FFT algorithms. Thedual odd FFT (DOFFT) was been selected since it provides the smallestcomplex FFT size and fewer complex operations than either the FFT or theodd frequency FFT (OFFT).

FIG. 47 gives a functional block diagram for an example of insertion ofthe cyclic prefix 700. The four main blocks of this diagram performfunctions analogous to blocks 602 to 612 of FIG. 45. The example of FIG.47 includes the spectral tone constellation encoder 702, IDOFFTmodulator 704 which converts N/2 complex tones into N real time-samples,a parallel to serial converter 706, and a digital to analog converter(D/A) 708. The cyclic prefix 710 is shown as taps from the originalsample data lines 712 from the IDOFFT block 704. The cyclic prefixreplaces the idle guard period and helps ensure that the receiver canrecover the full energy of the transmitted signal.

Data Link Layer Design

Referring back to the OSI Protocol of FIG. 20, the data link layer (DLL)304 of the OSI protocol framework includes sublayers for logical linkcontrol (LLC) 306 and medium access control (MAC) 308. Preferredembodiments for data link layer are described below. These include frameformat definitions, improved partition management protocol to reduce theprobability of RLI and FLT errors that can break synchronization for thescrambler and encryption engines, partition engines, RU and baseschedulers, and the MAC messages and procedures.

MAC Frame Structure

The MAC frame structure 780 is defined in FIG. 66. A common MAC header782 has forward link and reverse link versions. The goal is to minimizeconstant overhead by using optional extended MAC header 784, which areused for short and more frequent MAC messages, such as bandwidthrequest, partition allocation, timing adjustment, etc. The MAC servicedata unit (SDU) 786 can be concatenated for efficiency. The connectionID 788 is used to distinguish between different classes of services.Specifically,

-   -   0 for null SDU. It has no body and cannot be followed by any        non-null SDU    -   1 for MAC messages    -   2-7 reserved for operation and maintenance (OAM) messages    -   8-254 for LLC service access points of which 8-136 are reserved        for 64 VoIP connections.    -   32 for 20 ms VoIP and 32 for 10 ms VoIP    -   255 for global address

The common MAC header for the reverse link 790 is shown in FIG. 67. Theforward link common MAC header 800 is shown in FIG. 68. The versionfields 792 and 802 allow for future upgrades and are initially set to 0.The priority (P) field 794 is the dynamic bandwidth request is per RUwith P=1 indicating high priority. The header extension (HE) fields 796and 806 indicate whether an extended header (EH) is present. The powercontrol field 808 is a signed 4-bit integer. The reserved field (R) 804is set to 0. The MAC header check sequences (HCS) 798 and 810 are usedto check scrambler and encryption synchronization. Each uses a cyclicredundancy check with polynomial, x⁸+x²+x+1 over the header. Other partsof the frame are protected from bit errors with a Reed-Solomon code.

The format of the extended MAC header 784 of FIG. 66 is shown in FIG.69. Multiple extended headers are permitted. The last (L) field 822 isset to indicate that this is the last extended header in the frame.Various messages can be formulated by setting the type field 824, lengthfield 826, and value field 828. Reverse link messages include null andbandwidth request. Forward link messages include null, timingadjustment, add a partition, delete a partition, power control for theaccess partition, and power control for four way interleaving.

The MAC message format is shown in FIG. 70. The bandwidth managementmessages are contained in the extended header. The messages include:RangingRequest, TimeOfDayRequest, TimeOfDayResponse,MACRegistrationRequest, MACRegistrationReponse, MACRegistrationConfirm,RUModeRequest, RUModeResponse, EncryptionRequest, EncryptionResponse,EncryptionConfirm, ModulationChangeRequest, ModulationChangeResponse,ModulationChangeConfirm, MACConnectRequest, MACConnectResponse,MACConnectConfirm, MACDisconnectRequest, and MACDisconnectResponse.

The protocol data unit (PDU) format 830 is shown in FIG. 71. The 10-bitLength field 832 is the number of bytes in the PDU and is sufficient for4-way interleaving. The L field 834 is set to indicate that this is thelast segment of the segmentation and reassembly (SAR) process. TheSAR_Seq_No field 836 is the sequence number for the SAR. The logicallink control (LLC control) field 838 of is expanded in FIG. 72. Itprovides all signals required by the Institute for Electrical andElectronics Engineers standard IEEE 802.2 LLC for Type 1 (no ARQ) & Type2 (with ARQ) services. The automatic retransmission request window sizeis 128 (5 frames in 24 partitions). The window size can be 255 with aGo-back-N algorithm. Referring to FIG. 72, the command/response (CR)field 842 is 0 for commands and 1 for responses. The poll/final field844 is PF. The Control Bits field 846 define all types of LLC packets asdescribed in the IEEE 802.2 standards such as SABME (set asynchronousbalanced mode extended).

Voice can be sent across the airlink in either 20 or 10 ms voicesegments. The frame size and data rates for a 20 ms segment are shown inFIG. 73. The fields of a 20 ms voice segment service data unit (SDU) areshown in FIG. 74. The RTP/UDP/IP header is partially compressed. TheEthernet header is suppressed. The payload type (PT) field is clearedfor full header without payload (for compressor synchronization), and isset for compressed header with payload (normal payload).

The fields of a 10 ms voice segment SDU are shown in FIG. 75. The SDU issent in the second and third slots and another SDU is send the fifth andsixth slots. Thus there are two 10 ms voice segments in a 20 ms airlinkframe. This requires a fully compressed RTP/UDP/IP header and Ethernetheader and Frame check sequence suppression. There are separate SDU HCSto protect PDU header; the HCS in common MAC header does not cover theseparts. The frame size and data rates for a 10 ms segment are shown inFIG. 76.

FIG. 77 shows the number of partitions for various combinations of bitsper symbol, voice segment length, and vocoder.

Logical Link Control Sublayer

FIG. 78 shows the functional components of the data link layer (DLL) ofa preferred embodiment 850. The DLL functional block 852 includes theLLC sublayer functional block 854 and the MAC sublayer functional block856.

The DLL functional block 852 provides service to the network layer (NL)870 above it via a set of primitives, using the RU identification numberand the connection identification number as addresses. The LLC Scheduler858 selects which frames to transmit. A simple priority scheme is used:Voice>MAC Urgent>Data>MAC Normal>OAM. Clearly, more support for otherqualities of service can be provided with more queues and other apparentalgorithms. The MAC Scheduler 860 manages bandwidth assignment amongRUs. This is centrally controlled by the base. The RU makes bandwidthrequest and the base makes the partition allocation. The MAC Dispatcher862 parses and routes received frames. The MAC Message Handler 864 actson MAC management messages. The MAC Partition Engine 866 managesinteractions with the physical layer (PHY) 868, such as starting,maintaining, and closing partitions, and handling time slot interrupts,frame counter, data read/write.

The LLC distinguishes 20 ms voice, 10 ms voice, data, and managementmessages by the CID. For data, the IEEE 802.2 standard types 1 and 2 arefollowed. Type 1 transfers data without automatic retransmission request(ARQ). Type 2 handles ARQ using a go-back-N algorithm, includinginitialization and error recovery.

There are some deviations from the standard: signals are carried indifferent formats, but interpreted the same way, ARQ sequence numbersare larger for higher speed/longer delay, the DSAP and SSAP addressesare derived from the RU identification number and the connectionidentification number, group addresses not supported, the global addressis CID is 255, and there is an optional feature of packet aging.

For voice, the MAC sublayer provides bandwidth reservation service. Anew frame format is used for RTP with no ARQ. RTCP packets use Type 2.

The following is a list of the primitives between the NL and LLCsublayer for 10 ms voice, 20 ms voice, and data according to their CID:

-   1. DL_UnitData.Request(RUI.CID, Data, PT): The NL uses this    primitive to pass voice packets to the LLC or to send unnumbered    data packets. For voice, the connection setup must be performed    first.-   2. DL_UnitData.Indication(RUI.CID, Data, PT): The LLC calls this    primitive to pass received voice or unnumbered data packets to the    NL.-   3. DL_Connect.Request(RUI.CID, ServiceFlowID): When the LLC receives    this request from NL, it takes actions depending on the type of    service: (1) For data, LLC issues a SABME command to initialize the    ARQ engine. It then invokes MA_UnitData.Request to send the frame.    SFID is ignored for data. (2) For voice, LLC calls    MA_Connect.Request, which executes a MAC connection setup procedure    to reserve bandwidth. SFID indicates how many partitions (and    priority) are required. The LLC also issues a SABME command to    initialize the associated CID for RTCP.-   4. DL_Connect.Indication(RUI.CID): When the MAC receives a    MACConnectRequest message and is able to support the bandwidth    requirement, it invokes MA_Connect.Indication, which in turn issues    this primitive to the NL.-   5. DL_Connect.Response(RUI.CID, RspCode): NL issues this primitive    to LLC as a response to a DL_Connect.Indication primitive. For data,    the LLC sends a UA response. For voice, the LLC invokes    MA_Connect.Response, which in turn sends MACConnectResponse to the    remote entity.-   6. DL_Connect.Confirm(RUI.CID, RspCode): The LLC issues this    primitive to the NL as a response to DL_Connect.Request. For data,    it is caused by the receipt of UA response. For voice, when MAC    receives a MACConnectResponse from the remote entity, it invokes    MA_Connect.Confirm which causes LLC to generate this primitive in    turn.-   7. DL_Data.Request(RUI.CID, data): The NL uses this primitive to    pass data to the LLC for transmission with ARQ on. Connection bound    to RUI.CID must be open.-   8. DL_Data.Indication(RUI.CID, data): The LLC uses this primitive to    pass received data to the NL.-   9. DL_Disconnect.Request(RUI.CID): The NL issues this primitive to    close a connection. For data, the LLC sends a DISC command to the    remote LLC. For voice, the LLC invokes MA_Disconnect.Request, which    causes MAC to execute a MACDisconnect procedure.-   10. DL_Disconnect.Indication(RUI.CID, Reason): For data, the LLC    issues this primitive when it receives a DISC. For voice, when the    MAC receives a MACDisconnectRequest, it invokes    MA_Disconnect.Indication, which in turn causes the LLC to issue this    primitive to the NL. The MAC also sends a MACDisconnectConfirm to    the remote entity and closes the connection.-   11. DL_Reset.Request, DL_Reset.Indication, DL_Reset.Response,    DL_Reset.Acknowledge: This set of primitives are provided in the LLC    standard for the purpose of resetting the link and flushing    unacknowledged frames.-   12. DL_FlowControl.Request(RUI.CID, bytes): The NL uses this    primitive to throttle data flow from the LLC. A CID of 255 is used    to indicate the whole LLC sublayer.-   13. DL_FlowControl.Indication(RUI.CID, bytes): The LLC uses this    primitive to throttle data flow from the NL. A CID of 255 is used to    indicate the whole LLC sublayer. LLC and MAC sublayers communicate    with each other using the following set of primitives:-   1. MA_UnitData.Request, MA_UnitData.Indication: The LLC and MAC    schedulers interact via these primitives for basic data transfer.-   2. MA_Connect.Request, MA_Connect.Indication, MA_Connect.Response,    MA_Connect.Confirm, MA_Disconnect.Request, and    MA_Disconnect.Indication: The LLC scheduler uses these primitives to    interact with the MAC Message Handler for bandwidth reservation for    voice calls.

FIG. 79 illustrates the interactions of primitives used for voiceconnection setup. FIG. 80 shows the LLC state diagram for voiceconnection. The MAC does most of the connection set up and terminationfor voice, including error handling. The LLC simply passes the commandsand responses along (acting as a wrapper). However, the LLC is nottotally transparent: initially the LLC will ask the MAC to reservemultiple partitions for voice, in case the voice codecs are G.711, inaccordance with the International Telecommunications Union ITU-TRecommendation G.711. Later the LLC can request the MAC to removeexcessive reservation. On the other hand, the LLC could reserve a singlepartition for voice and request additional partitions if the voiceprotocol demands a higher data rate. FIG. 81 illustrates the interactionof primitives used for data connections. FIG. 82 shows the prior art LLCstate diagram for link control and FIG. 83 shows the prior art LLC statediagram for information transfer. Both FIG. 82 and FIG. 83 diagrams aredefined in the standard ISO/IEC 8802-2, a joint standard by theInternational Organization for Standardization and InternationalElectrotechnical Commission.

MAC Sublayer

FIG. 84 shows an overall state transition diagram of MAC sublayeroperations of the RU.

FIG. 85 shows an airlink frame 880, which includes 24 partitions 882 fortraffic and one partition 884 for access.

FIG. 86 shows the protocol for initiating a connection and data transfer890 using the partitions of FIG. 85. When a RU initiates a connection,it sends a RLA 892 on the access channel as a request. The base detectsthe RLA and allocates a partition using either a FLA or FLI 894. Whenthe base initiates a connection, it allocates a partition using eitherFLA or FLI 894. When the RU receives a FLA or a FLI, it sends a RLIfollowed by RLBs 896 in the allocated partition. When the base detects aRLI, it sends a FLT followed by FLBs 898. To close a partition, the basesends a de-allocation message 900 to the RU, indicating which partitionto close and when to close it. The same message will be sent twice toreduce the probability that neither message is received.

For open partitions, the base will flywheel through an occasional missof a RLI. The RU will flywheel through occasional miss of a FLT.However, consecutive misses of RLIs will cause the base to close thepartition, and consecutive misses of FLTs will cause the RU to close thepartition. Both will reinitialize their encryption and scramblingengines in this case.

The RU Partition Engine (PE) handles the airlink protocol. It has twocomponents: a frame-driven component for adding and deleting apartition, sending RLI and RLB and receiving FLI, FLA, and FLB, and aslot-driven component for data transfer to/from the physical layer(PHY). The RU partition engine provides services to RU MAC Scheduler(RMS) via the following primitives:

-   1. PE_Open(Partition, Configuration, OpenWait): OpenWait indicates    the number RL entry slots before send the first RLI. Configuration    indicates constellation, encryption, etc, to use for FLB. Results of    this function are reflected in the partition state.-   2. PE_Close(Partition, CloseWait): CloseWait has a similar meaning    to OpenWait.-   3. PE_SendData(Partition, Configuration, Data)-   4. PE_RcvData(data, RSError): this is a call-back function provided    by MAC Dispatcher to receive FLBs.-   5. PE_FLARcvd(Burst1, Burst2, Burst3, Burst4): this call-back    function is provided by RMS to receive the FLA list.-   6. PE_SendRLA( ): RMS calls this function to request the partition    engine to send a RLA in the access channel.7. Other functions for    configuring PHY, like Power Control, Ranging,

etc.FIG. 87 shows a state diagram of the frame driven component of RUpartition engine (PE) 910. For the 24 traffic channels,Partition.SendRLB flags tell RMS which partition it should pass data toPE. SendRLB is false in the CLOSED state 912 and WAIT state 914 and truein the OPEN state 916 and ENDING state 918. The actions associated withthe numbered events in FIG. 87 are:

-   1. Update OpenWait-   2. Decrement OpenWait-   3. Prepare RLI for DMA; set FLTLoss=0-   4. Prepare RLB for DMA-   5. Call PE_RcvData-   6. Prepare RLI for DMA; set FLTLoss=0-   7. FLTLoss=0-   8. Increment FLTLoss-   9. Decrement CloseWait-   10. Update CloseWait-   11. Set SendRLB=F; FLBEngine=Off-   12. Set SendRLB=F; FLBEngine=Off; reinitialize RLB and FLB engines.

In the OPEN state 916 and ENDING state 918, the PE keeps sending RLIs,unless excluded by the base transmit/receive compensation. In the CLOSEDstate 912 and WAIT state 914, the PE also keeps writing No_Data to thePHY. The slot-driven component of RU PE is basically a driver for PHY.FIG. 88 shows a flow diagram for the slot-driven component of the RU PE.It is driven by PHY interrupts. Timing of interrupts and tasks arecoordinated carefully with the PHY. The RU MAC Scheduler handles RUstate transitions between active (both active on and active off) andinactive, and contention on the access channel. FIG. 89 shows the RU MACScheduler state transition diagram and FIG. 90 lists the actionsassociated with each event.

The base partition engine is the counterpart of the RU PE. It is themain entity in the base that handles the airlink protocol. Similar to RUPE, the base PE also has two components: a frame-driven component foradding and deleting a RU, sending FLB and receiving RLB, and aslot-driven component for data transfer to and from the PHY. The base PEprovides its services via the following primitives:

-   1. PE_Open(AccessCode, Configuration, OpenWait): AccessCode is NULL    if allocation messages were sent via FLA or FLB. OpenWait indicates    the number RL entry slots before the expected RLI. Results of this    function are reflected in state variables-   2. PE_Close(AccessCode, CloseWait)-   3. PE_RcvMACData(RUID, MAC data): This is a call-back function    provided by MAC Dispatcher to receive RU list, power control and    ranging info, etc.-   4. PE_SendData(RUID, Configuration, Data):-   5. PE_RcvData(RUID, Data, RSError): This is a call-back function    provided by MAC Dispatcher to receive RLB.

FIG. 91 shows a state diagram of the frame driven component of the basePE 920. A RUID.SendFLB flag tells MAC Scheduler if it should pass datato PE. SendFLB is false in the CLOSED state 922, WAIT state 924, andSTART state 926 and true in the OPEN state 928 and ENDING state 930.Logically each RU has its own instance of this state machine. Theactions associated with numbered events shown in FIG. 91 are:

-   1. Schedule FLI (if not NULL)-   2. Decrement OpenWait-   3. Add RLI (weights=0); set RLILoss=0-   4. Increment RLILoss, advance FLB engines-   5. Set SendFLB =T; RLILoss=0-   6. Prepare data for transfer to PHY-   7. Call PE_RcvData-   8. No action-   9. Decrement CloseWait-   10. Set SendFLB=F; Delete RLI-   11. Set RLILoss=0-   12. Increment RLILoss-   13. Set SendFLB=F; delete RLI; reinitialize RLB/FLB engines

FIG. 92 shows a flow diagram for the slot driven component of the basePE. It is basically a hardware driver for PHY, and is driven byinterrupts from PHY. The base PE also performs encryption and scramblerinitialization. The base PE for the access channel is somewhat differentfrom that for the traffic channel.

FIG. 93 shows the state diagram of base PE for the access channel. It isalways slot driven. Its main function is to fetch a list of detectedRLAs and transmit FLA as requested by the base MAC scheduler (BMS).Primitives at the interface with BMS are:

-   1. PE_RLADetected(RLA list): This call-back function is provided by    the BMS to receive the detected RLA list.-   2. PE_SendFLA(FLA1, FLA2, FLA3, FLA4): The BMS calls this function    to request the PE to send FLAs in bursts 1–4.

The BMS performs the following tasks to manage the partition allocation:calculation of the allocation for each RU, calculation of whichpartitions to add or delete from a RU, calculate the number of frames towait until the actual add or delete will occur taking into account thetime it takes to send repeated MAC messages, schedule a MAC message tobe sent at least twice, and start the partition engine.

FIG. 94 shows examples of allocation changes for a CHANGE field based onthe backlog for each RU. The backlog is the maximum of the reverse linkqueue depth and the forward link queue depth. The RU uses the extendedheader to send the reverse link queue depth. The total number ofpartitions allocated to a RU is a function of its backlog. One method isto make the number of partitions proportional to the ratio of the RU'sbacklog to the total of all of the RU's backlog. The CHANGE field is thedifference between the new allocation and the previous allocation.

Specific partitions are then selected to be added or deleted from theRU. If the RU has a flow open with a RU and CHANGE is negative, thenmark the partition for that RU to be deleted. If the RU does not have aflow with a RU and the CHANGE is positive, then mark the partition forthat RU to be added. Only a limited number of additions can occur in aslot due to the number of FLA and FLI bursts. The order in which the RUsare selected for additions is randomized to ensure fairness. If severalRUs are nearly in the same azimuthal direction from the base, thenassign them to different partitions. The cross-correlation between theRU aperture of the RU to add to a partition and the RU aperturescurrently assigned to that partition can also be calculated, and if low,then the new RU is assigned to that partition and if high, the RU isassigned to a different partition.

The BMS also sends FLBs to each RU. The BMS arbitrates between sending aprovisioned, ranging, and installation FLAs. The BMS gives voice ahigher priority than data in allocating partitions.

As the distance between the RU and the base decreases, the RU advancesits transmission time so that transmissions from all of the RUs arriveat the base at approximately the same time and within the base receivewindow that includes the samples to be transformed to the frequencydomain. To start ranging, the RU chooses an initial power level based onthe FLS signal strength and an initial timing, and sends the ranging RLAand waits for the ranging FLA. The wait time is the round trip time bydefault. If the ranging FLA is not received, RU adjusts its power andtiming and repeats the process. It does this until it receives theranging FLA or until it covers the entire power-time space a prescribednumber of times. If this occurs, RU MAC issues a ranging failure signal.Each RU randomly chooses a ranging access code for each RLA transmissionand FLA reception pair. If the RU receives the ranging FLA, it freezesthe power and timing settings and sends its own RLA, provisioned orinstallation, to request a partition. Once a bearer channel isestablished, the base will correct the residual power and timing errorsusing the extended MAC header. Once the RU has determined its range fromthe base, the amount of transmission advancement is stored innon-volatile RU memory. The RU picks a power level and tries differenttimings in about 1 μs steps. If it covers the entire range withoutreceiving a ranging FLA, it increases power level by 4 dB and repeatsthe time steps. For a 15 km cell radius, the range is 100 μs, whichtakes 600 slots or 2 seconds to cover the entire time range once. Analternative method of ranging is to use GPS to identify the position ofthe RU and the distance from the base when the RU is installed.

FIG. 95 gives the messages, states and actions of a base and RU forstarting a normal flow. A probability of missing a particular type ofmessage is indicated by Pm(message). A probability of falsely detectinga particular type of message is indicated by Pf(message). FIG. 95 showsa sequence of events starting with a base sending a FLI to initiate of aflow.

FIG. 96 gives the messages, states and actions of a base and RU forvarious error conditions that may occur during the start of a flow.Error conditions include missing or falsely detecting various messages.

Although the present invention has been described in terms of thepresently preferred embodiments, it is to be understood that thedisclosure is not to be interpreted as limiting. Various alterations andmodifications will no doubt be come apparent to those skilled in the artafter having read the above disclosure. Accordingly, it is intended thatthe appended claims are interpreted as covering all alterations andmodifications as fall within the true spirit and scope of the invention.

1. A base station receiver system for recovering a plurality of datastreams from a plurality of signals, each signal transmitted from acorresponding one of a plurality of remote units in a radiocommunication network, comprising: a receiver coupled to receive saidsignals, said receiver forming an input data matrix; a demultiplexercoupled to receive said input data matrix, said demultiplexer separatingsaid input data matrix into a preamble data matrix and an informationdata matrix; a matrix decomposition processor coupled to receive saidpreamble data matrix and providing a first decomposition matrix and asecond decomposition matrix, wherein said first decomposition matrix issubstantially orthogonal and said second decomposition matrix issubstantially upper triangular; a detector with an input for said firstdecomposition matrix and using a set of substantially orthogonalpreamble vectors to provide a set of detected preamble correlationvectors, wherein said each detected preamble correlation vectorcorresponds to one of said plurality of remote units; a weight vectorgenerator coupled to receive said second decomposition matrix and saiddetected preamble correlation vectors and providing a set of weightvectors, wherein each of said weight vectors is computed using acorresponding one of said set of detected preamble correlation vectors;and a despreader coupled to receive said information data matrix andsaid set of weight vectors and providing a set of despread symbolvectors, wherein each despread symbol vector corresponds to one of saidplurality of remote units.
 2. The base station receiver system of claim1, wherein said matrix decomposition processor comprises a QRdecomposition.
 3. The base station receiver system of claim 1, whereinsaid QR decomposition is calculated according to a recursive algorithm.4. The base station receiver system of claim 1, wherein said detectorcomprises: a correlator for providing a set of preamble correlationvectors, wherein each preamble correlation vector corresponds to across-correlation of said first decomposition matrix and a correspondingone of said set of preamble vectors; and a selector for selecting saidset of detected preamble correlation vectors from said set of preamblecorrelation vectors.
 5. The base station receiver system of claim 1,wherein said detector comprises: a fast transform processor forproducing a set of preamble correlation vectors, wherein said set ofpreamble vectors comprises a set of fast transform basis functions forsaid fast transform processor and each preamble correlation vectorcorresponds to a cross-correlation of said first decomposition matrixand a corresponding one of said set of fast transform basis functions;and a selector for selecting said set of detected preamble correlationvectors from said set of preamble correlation vectors.
 6. The basestation receiver system of claim 5, wherein: said set of fast transformbasis functions comprises a set of Hadamard basis functions; and saidfast transform processor comprises a fast Hadamard transform.
 7. Thebase station receiver system of claim 5, wherein: said set of fasttransform basis functions comprises a set of fast Fourier transformbasis functions; and said fast transform processor comprises a fastFourier transform.
 8. The base station receiver system of claim 7,wherein said detector further comprises: a delay synchronizer forremoving a delay offset using said fast Fourier transform.
 9. The basestation receiver system of claim 5, wherein: said set of fast transformbasis functions comprises a set of Kronecker basis functions; and saidfast transform processor comprises a fast Kronecker transform.
 10. Thebase station receiver system of claim 1, further comprising: a decodercoupled to receive said set of despread symbol vectors and reproducingsaid plurality of data streams, wherein each data stream corresponds toone of said plurality of remote units.
 11. The base station receiversystem of claim 1, further comprising: a delay equalizer coupled toreceive said set of despread symbol vectors and producing a set of delaycorrected symbol vectors, and a decoder coupled to receive said set ofdelay corrected symbol vectors and reproducing a plurality of datastreams, wherein each data stream corresponds to one of said pluralityof remote units.
 12. The base station receiver system of claim 1,wherein: said set of weight vectors are updated in accordance with anadaptive algorithm.
 13. A base station receiver system for recovering aplurality of data streams from a plurality of signals, each signaltransmitted from a corresponding one of a plurality of remote units in aradio communication network, comprising: a receiver coupled to receivesaid signals, said receiver forming an input data matrix; ademultiplexer coupled to receive said input data matrix, saiddemultiplexer separating said input data matrix into a preamble datamatrix and an information data matrix; a matrix decomposition processorcoupled to receive said preamble data matrix and providing a firstdecomposition matrix and a second decomposition matrix, wherein saidfirst decomposition matrix is substantially orthogonal and said seconddecomposition matrix is substantially upper triangular; a multiplierusing element by element multiplication of a base code vector with saidfirst decomposition matrix and providing a descrambled matrix; adetector with an input for said descrambled matrix and using a set ofsubstantially orthogonal preamble vectors to provide a set of detectedpreamble correlation vectors, wherein said each detected preamblecorrelation vector corresponds to one of said plurality of remote units;a weight vector generator coupled to receive said second decompositionmatrix and said detected preamble correlation vectors and providing aset of weight vectors, wherein each of said weight vectors is computedusing a corresponding one of said set of detected preamble correlationvectors; and a despreader coupled to receive said information datamatrix and said set of weight vectors and providing a set of despreadsymbol vectors, wherein each detected despread symbol vector correspondsto one of said plurality of remote units.
 14. The base station receiversystem of claim BR2, wherein said matrix decomposition processorcomprises a QR decomposition.
 15. The base station receiver system ofclaim 13, wherein said QR decomposition is calculated according to arecursive algorithm.
 16. The base station receiver system of claim 13,wherein said detector comprises: a correlator for providing a set ofpreamble correlation vectors, wherein each preamble correlation vectorcorresponds to a cross-correlation of said descrambled matrix and acorresponding one of said set of preamble vectors; and a selector forselecting said set of detected preamble correlation vectors from saidset of preamble correlation vectors.
 17. The base station receiversystem of claim 13, wherein said detector comprises: a fast transformprocessor for producing a set of preamble correlation vectors, whereinsaid set of preamble vectors comprises a set of fast transform basisfunctions for said fast transform processor and each preamblecorrelation vector corresponds to a cross-correlation of saiddescrambled matrix and a corresponding one of said set of fast transformbasis functions; and a selector for selecting said set of detectedpreamble correlation vectors from said set of preamble correlationvectors.
 18. The base station receiver system of claim 17, wherein: saidset of fast transform basis functions comprises a set of Hadamard basisfunctions; and said fast transform processor comprises a fast Hadamardtransform.
 19. The base station receiver system of claim 17, wherein:said set of fast transform basis functions comprises a set of fastFourier transform basis functions; and said fast transform processorcomprises a fast Fourier transform.
 20. The base station receiver systemof claim 19, wherein said detector further comprises: a delaysynchronizer for removing a delay offset using said fast Fouriertransform.
 21. The base station receiver system of claim 17, wherein:said set of fast transform basis functions comprises a set of Kroneckerbasis functions; and said fast transform processor comprises a fastKronecker transform.
 22. The base station receiver system of claim 17,further comprising: a decoder coupled to receive said set of despreadsymbol vectors and reproducing said plurality of data streams, whereineach data stream corresponds to one of said plurality of remote units.23. The base station receiver system of claim 17, further comprising: adelay equalizer coupled to receive said set of despread symbol vectorsand producing a set of delay corrected symbol vectors, and a decodercoupled to receive said set of delay corrected symbol vectors andreproducing a plurality of data streams, wherein each data streamcorresponds to one of said plurality of remote units.
 24. The basestation receiver system of claim 17, wherein: said set of weight vectorsare updated in accordance with an adaptive algorithm.
 25. A remote unitreceiver system for recovering a data stream from a signal transmittedfrom a base station in a radio communication network, comprising: areceiver coupled to received said signal, said receiver forming an inputdata matrix; a demultiplexer having an input coupled to receive saidinput data matrix, wherein said demultiplexer separates said input datamatrix into a preamble data matrix and an information data matrix; amatrix decomposition processor coupled to receive said preamble datamatrix and providing a first decomposition matrix and a seconddecomposition matrix wherein said first decomposition matrix issubstantially orthogonal and said second decomposition matrix issubstantially upper triangular; a correlator coupled to receive saidfirst decomposition matrix and providing a correlation vector, whereinsaid correlation vector is a cross-correlation of said firstdecomposition matrix and a preamble vector uniquely associated with saidremote unit; a weight vector generator coupled to receive said seconddecomposition matrix and said correlation vector and providing a weightvector; and a despreader coupled to receive said information data matrixand said weight vector and providing a despread symbol vector.
 26. Theremote unit receiver system of claim 25 wherein: said set of preamblevectors comprises a set of fast transform basis functions with acorresponding fast transform.
 27. The remote unit receiver system ofclaim 26, wherein: said set of fast transform basis functions comprisesa set of Hadamard basis functions.
 28. The remote unit receiver systemof claim 26, wherein: said set of fast transform basis functionscomprises a set of fast Fourier transform basis functions.
 29. Theremote unit receiver system of claim 26, wherein: said set of fasttransform basis functions comprises a set of Kronecker basis functions.30. The remote unit receiver system of claim 26, further comprising: adecoder for reproducing said data stream from said despread symbolvector.
 31. The remote unit receiver system of claim 25, wherein: saidweight vector is updated in accordance with an adaptive algorithm.
 32. Amethod for communicating a data stream from a base unit to a destinationremote unit in a radio communication network, comprising the steps of:mapping said data stream to a sequence of information symbols; selectinga unique preamble for said destination remote unit; concatenating saidpreamble with said sequence of information symbols to form aconcatenated signal; spreading said concatenated signal using a basespreading weight vector associated with said destination remote unit toform a spread signal; transmitting said spread signal; receiving saidspread signal at said destination remote unit to form an input datamatrix; separating said input data matrix into a preamble data matrixand an information data matrix; detecting said preamble in said preambledata matrix; and applying a remote unit despreading weight vector tosaid information data matrix to form a sequence of information symbolestimates.
 33. A method as claimed in claim 32, further comprising thestep of: recovering said data stream from said sequence of informationsymbol estimates.
 34. A method as claimed in claim 32, wherein: saidpreamble is selected from a set of substantially orthogonal preambles.35. A method as claimed in claim 32, wherein: said preamble is selectedfrom a set of fast transform basis functions with a corresponding fasttransform.
 36. A method as claimed in claim 35, wherein: said set offast transform basis functions comprise a set of fast Fourier transformbasis functions; and said corresponding fast transform comprises a fastFourier transform.
 37. A method as claimed in claim 25, wherein: saidset of fast transform basis functions comprise a set of Hadamardtransform basis functions; and said corresponding fast transformcomprises a fast Hadamard transform.
 38. A method as claimed in claim35, wherein: said set of fast transform basis functions comprise a setof Kronecker transform basis functions; and said corresponding fasttransform comprises a fast Kronecker transform.
 39. A method as claimedin claim 32, further comprising the step of: initializing said basespreading weight vector in response to an initiation signal transmittedfrom said destination remote unit.
 40. A method as claimed in claim 39,wherein said initializing step occurs before said spreading step.
 41. Amethod as claimed in claim 39, wherein the step of detecting saidpreamble, further comprises the steps of: decomposing said preamble datamatrix into a first decomposition matrix and a second decompositionmatrix, wherein said first decomposition matrix is substantiallyorthogonal and said second decomposition matrix is substantially uppertriangular; and correlating said first decomposition matrix with saidpreamble to form a correlation vector.
 42. A method as claimed in claim41, wherein the step of decomposing said preamble data matrix comprisesa QR decomposition.
 43. A method as claimed in claim 42, wherein said QRdecomposition is calculated according to a recursive algorithm.
 44. Amethod as claimed in claim 41, further comprising the step of:generating said remote unit despreading weight vector using said seconddecomposition matrix and said correlation vector.
 45. A method asclaimed in claim 32, further comprising the step of: updating saidremote unit despreading weight vector using an adaptive algorithm.
 46. Amethod as claimed in claim 32, further comprising the steps of:calculating a norm of said base spreading weight vector; comparing saidnorm to a predetermined range, said range having a lower threshold andan upper threshold; increasing a gain of said base spreading weightvector if said norm is less than said lower threshold; and decreasingsaid gain of said base spreading weight vector if said norm is greaterthan said upper threshold.
 47. A method as claimed in claim 36, furthercomprising the steps of: transmitting a power control message to saiddestination remote unit; receiving said power control message at saiddestination remote unit; adjusting said remote unit despreading weightvector in accordance with said power control message; and adjusting aremote unit spreading weight vector in accordance with said powercontrol message.
 48. A method as claimed in claim 47, wherein:increasing said gain of said base spreading weight vector comprisesmultiplying by a predetermined factor; said power control message is adecrease power message if said norm is less than said lower threshold;adjusting said remote unit despreading weight vector comprisesmultiplying by an inverse of said predetermined factor if said powercontrol message is said decrease power message; adjusting said remoteunit spreading weight vector comprises multiplying by said inverse ofsaid predetermined factor if said power control message is a decreasepower message; decreasing said gain of said base spreading weight vectorcomprises multiplying by said inverse of said predetermined factor; saidpower control message is an increase power message if said norm isgreater than said upper threshold; adjusting said remote unitdespreading weight vector comprises multiplying by said predeterminedfactor if said power control message is an increase power message; andadjusting said remote unit spreading weight vector comprises multiplyingby said predetermined factor if said power control message is anincrease power message.
 49. A base station receiver system forrecovering a plurality of data streams from a plurality of signals, eachsignal transmitted from a corresponding one of a plurality of remoteunits in a radio communication network and each signal having a preambleportion and an information data portion, comprising: a receiver coupledto receive said signals, said receiver forming an input data matrix witha preamble portion corresponding to said preamble portion of saidsignals and an information data portion corresponding to saidinformation data portion of said signals; a matrix decompositionprocessor coupled to receive said preamble data portion of said inputdata matrix and providing a first decomposition matrix and a seconddecomposition matrix; a detector with an input for said firstdecomposition matrix and using a set of substantially orthogonalpreamble vectors to provide a set of detected preamble correlationvectors, wherein said each detected preamble correlation vectorcorresponds to one of said plurality of remote units; a weight vectorgenerator coupled to receive said second decomposition matrix and saiddetected preamble correlation vectors and providing a set of weightvectors, wherein each of said weight vectors is computed using acorresponding one of said set of detected preamble correlation vectors;and a despreader coupled to receive said information data portion ofsaid input data matrix and said set of weight vectors and providing aset of despread symbol vectors, wherein each despread symbol vectorcorresponds to one of said plurality of remote units.
 50. A method asclaimed in claim 49, wherein: said first decomposition matrix issubstantially orthogonal and said second decomposition matrix issubstantially upper triangular.
 51. The base station receiver system ofclaim 49, wherein said matrix decomposition processor comprises a QRdecomposition.
 52. The base station receiver system of claim 49, whereinsaid QR decomposition is calculated according to a recursive algorithm.53. The base station receiver system of claim 49, wherein said detectorcomprises: a correlator for providing a set of preamble correlationvectors, wherein each preamble correlation vector corresponds to across-correlation of said first decomposition matrix and a correspondingone of said set of preamble vectors; and a selector for selecting saidset of detected preamble correlation vectors from said set of preamblecorrelation vectors.
 54. The base station receiver system of claim 49,wherein said detector comprises: a fast transform processor forproducing a set of preamble correlation vectors, wherein said set ofpreamble vectors comprises a set of fast transform basis functions forsaid fast transform processor and each preamble correlation vectorcorresponds to a cross-correlation of said first decomposition matrixand a corresponding one of said set of fast transform basis functions;and a selector for selecting said set of detected preamble correlationvectors from said set of preamble correlation vectors.
 55. The basestation receiver system of claim 54, wherein: said set of fast transformbasis functions comprises a set of Hadamard basis functions; and saidfast transform processor comprises a fast Hadamard transform.
 56. Thebase station receiver system of claim 54, wherein: said set of fasttransform basis functions comprises a set of fast Fourier transformbasis functions; and said fast transform processor comprises a fastFourier transform.
 57. The base station receiver system of claim 56,wherein said detector further comprises: a delay synchronizer forremoving a delay offset using said fast Fourier transform.
 58. The basestation receiver system of claim 54, wherein: said set of fast transformbasis functions comprises a set of Kronecker basis functions; and saidfast transform processor comprises a fast Kronecker transform.
 59. Thebase station receiver system of claim 49, further comprising: a decodercoupled to receive said set of despread symbol vectors and reproducingsaid plurality of data streams, wherein each data stream corresponds toone of said plurality of remote units.
 60. The base station receiversystem of claim 49, further comprising: a delay equalizer coupled toreceive said set of despread symbol vectors and producing a set of delaycorrected symbol vectors, and a decoder coupled to receive said set ofdelay corrected symbol vectors and reproducing a plurality of datastreams, wherein each data stream corresponds to one of said pluralityof remote units.
 61. The base station receiver system of claim 49,wherein: said set of weight vectors are updated in accordance with anadaptive algorithm.
 62. A base station receiver system for recovering aplurality of data streams from a plurality of signals, each signaltransmitted from a corresponding one of a plurality of remote units in aradio communication network and each signal having a preamble portionand an information data portion, comprising: a receiver coupled toreceive said signals, said receiver forming an input data matrix with apreamble portion corresponding to said preamble portion of said signalsand an information data portion corresponding to said information dataportion of said signals; a matrix decomposition processor coupled toreceive said preamble portion of said input data matrix and providing afirst decomposition matrix and a second decomposition matrix; amultiplier using element by element multiplication of a base code vectorwith said first decomposition matrix and providing a descrambled matrix;a detector with an input for said descrambled matrix and using a set ofsubstantially orthogonal preamble vectors to provide a set of detectedpreamble correlation vectors, wherein said each detected preamblecorrelation vector corresponds to one of said plurality of remote units;a weight vector generator coupled to receive said second decompositionmatrix and said detected preamble correlation vectors and providing aset of weight vectors, wherein each of said weight vectors is computedusing a corresponding one of said set of detected preamble correlationvectors; and a despreader coupled to receive said information dataportion of said input data matrix and said set of weight vectors andproviding a set of despread symbol vectors, wherein each detecteddespread symbol vector corresponds to one of said plurality of remoteunits.
 63. A method as claimed in claim 62, wherein: said firstdecomposition matrix is substantially orthogonal and said seconddecomposition matrix is substantially upper triangular.
 64. The basestation receiver system of claim 62, wherein said matrix decompositionprocessor comprises a QR decomposition.
 65. The base station receiversystem of claim 62, wherein said QR decomposition is calculatedaccording to a recursive algorithm.
 66. The base station receiver systemof claim 62, wherein said detector comprises: a correlator for providinga set of preamble correlation vectors, wherein each preamble correlationvector corresponds to a cross-correlation of said descrambled matrix anda corresponding one of said set of preamble vectors; and a selector forselecting said set of detected preamble correlation vectors from saidset of preamble correlation vectors.
 67. The base station receiversystem of claim 62, wherein said detector comprises: a fast transformprocessor for producing a set of preamble correlation vectors, whereinsaid set of preamble vectors comprises a set of fast transform basisfunctions for said fast transform processor and each preamblecorrelation vector corresponds to a cross-correlation of saiddescrambled matrix and a corresponding one of said set of fast transformbasis functions; and a selector for selecting said set of detectedpreamble correlation vectors from said set of preamble correlationvectors.
 68. The base station receiver system of claim 67, wherein: saidset of fast transform basis functions comprises a set of Hadamard basisfunctions; and said fast transform processor comprises a fast Hadamardtransform.
 69. The base station receiver system of claim 67, wherein:said set of fast transform basis functions comprises a set of fastFourier transform basis functions; and said fast transform processorcomprises a fast Fourier transform.
 70. The base station receiver systemof claim 69, wherein said detector further comprises: a delaysynchronizer for removing a delay offset using said fast Fouriertransform.
 71. The base station receiver system of claim 67, wherein:said set of fast transform basis functions comprises a set of Kroneckerbasis functions; and said fast transform processor comprises a fastKronecker transform.
 72. The base station receiver system of claim 62,further comprising: a decoder coupled to receive said set of despreadsymbol vectors and reproducing said plurality of data streams, whereineach data stream corresponds to one of said plurality of remote units.73. The base station receiver system of claim 62, further comprising: adelay equalizer coupled to receive said set of despread symbol vectorsand producing a set of delay corrected symbol vectors, and a decodercoupled to receive said set of delay corrected symbol vectors andreproducing a plurality of data streams, wherein each data streamcorresponds to one of said plurality of remote units.
 74. The basestation receiver system of claim 62, wherein: said set of weight vectorsare updated in accordance with an adaptive algorithm.
 75. A remote unitreceiver system for recovering a data stream from a signal transmittedfrom a base station in a radio communication network, said signal havinga preamble portion and an information data portion, comprising: areceiver coupled to received said signal, said receiver forming an inputdata matrix with a preamble portion corresponding to said preambleportion of said signal and an information data portion corresponding tosaid information data portion of said signal; a matrix decompositionprocessor coupled to receive said preamble portion of said input datamatrix and providing a first decomposition matrix and a seconddecomposition matrix; a correlator coupled to receive said firstdecomposition matrix and providing a correlation vector, wherein saidcorrelation vector is a cross-correlation of said first decompositionmatrix and a preamble vector uniquely associated with said remote unit;a weight vector generator coupled to receive said second decompositionmatrix and said correlation vector and providing a weight vector; and adespreader coupled to receive said information data portion of saidinput data matrix and said weight vector and providing a despread symbolvector.
 76. A method as claimed in claim 75, wherein: said firstdecomposition matrix is substantially orthogonal and said seconddecomposition matrix is substantially upper triangular.
 77. The remoteunit receiver system of claim 75 wherein: said set of preamble vectorscomprises a set of fast transform basis functions with a correspondingfast transform.
 78. The remote unit receiver system of claim 77,wherein: said set of fast transform basis functions comprises a set ofHadamard basis functions.
 79. The remote unit receiver system of claim77, wherein: said set of fast transform basis functions comprises a setof fast Fourier transform basis functions.
 80. The remote unit receiversystem of claim 77, wherein: said set of fast transform basis functionscomprises a set of Kronecker basis functions.
 81. The remote unitreceiver system of claim 75, further comprising: a decoder forreproducing said data stream from said despread symbol vector.
 82. Theremote unit receiver system of claim 75, wherein: said weight vector isupdated in accordance with an adaptive algorithm.
 83. A method forcommunicating a plurality of data streams from a base unit to aplurality of remote units in a radio communication network, each one ofsaid plurality of data streams being destined for a corresponding one ofsaid plurality of remote units, comprising the steps of: converting saidplurality of data streams into a plurality of signal vectors, whereineach signal vector comprises a sequence of information symbols and apreamble associated with a corresponding one of said plurality of remoteunits; spreading said plurality of signal vectors using a plurality ofbase spreading weight vectors to form a composite spread signal, whereineach one of said plurality of base spreading weight vectors isassociated with a corresponding one of said plurality of remote unitsand is applied to the signal vector destined for said correspondingremote unit; transmitting said composite spread signal; receiving saidcomposite spread signal at each one of said plurality of remote units;forming an input data matrix at each remote unit, wherein said inputdata matrix comprises a preamble portion and an information dataportion; detecting at each remote unit said associated preamble for saidremote unit in said preamble portion; and applying a remote unitdespreading weight vector at each remote unit to said information dataportion to reconstruct said sequence of information symbolscorresponding to said remote unit.
 84. A method as claimed in claim 83,further comprising the step of: recovering said data streamcorresponding to said remote unit from said reconstructed sequence ofinformation symbols at each remote unit.
 85. A method as claimed inclaim 83, wherein: said preamble associated with said corresponding oneof said plurality of remote units is selected from a set ofsubstantially orthogonal preambles.
 86. A method as claimed in claim 83,wherein: said preamble associated with said corresponding one of saidplurality of remote units is selected from a set of fast transform basisfunctions with a corresponding fast transform.
 87. A method as claimedin claim 86, wherein: said set of fast transform basis functionscomprise a set of fast Fourier transform basis functions; and saidcorresponding fast transform comprises a fast Fourier transform.
 88. Amethod as claimed in claim 86, wherein: said set of fast transform basisfunctions comprise a set of Hadamard transform basis functions; and saidcorresponding fast transform comprises a fast Hadamard transform.
 89. Amethod as claimed in claim 86, wherein: said set of fast transform basisfunctions comprise a set of Kronecker transform basis functions; andsaid corresponding fast transform comprises a fast Kronecker transform.90. A method as claimed in claim 83, further comprising the step of:initializing each base spreading weight vector of said plurality of basespreading weight vectors in response to an initiation signal transmittedfrom said corresponding remote unit.
 91. A method as claimed in claim90, wherein said initializing step occurs before said spreading step.92. A method as claimed in claim 83, wherein the step of detecting ateach remote unit further comprises the steps of: decomposing saidpreamble portion of said input data matrix into a first decompositionmatrix and a second decomposition matrix; and correlating said firstdecomposition matrix with said preamble corresponding to said remoteunit to form a correlation vector.
 93. A method as claimed in claim 92,wherein: said first decomposition matrix is substantially orthogonal andsaid second decomposition matrix is substantially upper triangular. 94.A method as claimed in claim 93, wherein the step of decomposing saidpreamble data matrix comprises a QR decomposition.
 95. A method asclaimed in claim 94, wherein said QR decomposition is calculatedaccording to a recursive algorithm.
 96. A method as claimed in claim 92,further comprising the step of: generating said remote unit despreadingweight vector at each remote unit using said second decomposition matrixand said correlation vector.
 97. A method as claimed in claim 83,further comprising the step of: updating said remote unit despreadingweight vector at each remote unit using an adaptive algorithm.